/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:59:25,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:59:25,895 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:59:25,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:59:25,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:59:25,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:59:25,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:59:25,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:59:25,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:59:25,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:59:25,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:59:25,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:59:25,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:59:25,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:59:25,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:59:25,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:59:25,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:59:25,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:59:25,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:59:25,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:59:25,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:59:25,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:59:25,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:59:25,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:59:25,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:59:25,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:59:25,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:59:25,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:59:25,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:59:25,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:59:25,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:59:25,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:59:25,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:59:25,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:59:25,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:59:25,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:59:25,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:59:25,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:59:25,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:59:25,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:59:25,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:59:25,975 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:59:26,007 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:59:26,007 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:59:26,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:59:26,012 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:59:26,012 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:59:26,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:59:26,012 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:59:26,013 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:59:26,013 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:59:26,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:59:26,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:59:26,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:59:26,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:59:26,014 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:59:26,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:59:26,014 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:59:26,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:59:26,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:59:26,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:59:26,015 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:59:26,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:59:26,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:59:26,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:59:26,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:59:26,017 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:59:26,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:59:26,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:59:26,017 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:59:26,018 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:59:26,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:59:26,018 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:59:26,018 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:59:26,307 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:59:26,326 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:59:26,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:59:26,331 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:59:26,333 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:59:26,333 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_pso.opt.i [2019-12-27 21:59:26,404 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/497a77778/4ccdc75a80eb4aba955cdbd602b545ff/FLAG3621516ae [2019-12-27 21:59:26,955 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:59:26,955 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_pso.opt.i [2019-12-27 21:59:26,971 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/497a77778/4ccdc75a80eb4aba955cdbd602b545ff/FLAG3621516ae [2019-12-27 21:59:27,193 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/497a77778/4ccdc75a80eb4aba955cdbd602b545ff [2019-12-27 21:59:27,205 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:59:27,207 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:59:27,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:59:27,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:59:27,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:59:27,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:59:27" (1/1) ... [2019-12-27 21:59:27,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b2b3be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:27, skipping insertion in model container [2019-12-27 21:59:27,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:59:27" (1/1) ... [2019-12-27 21:59:27,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:59:27,299 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:59:27,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:59:27,835 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:59:27,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:59:28,006 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:59:28,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:28 WrapperNode [2019-12-27 21:59:28,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:59:28,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:59:28,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:59:28,008 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:59:28,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:28" (1/1) ... [2019-12-27 21:59:28,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:28" (1/1) ... [2019-12-27 21:59:28,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:59:28,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:59:28,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:59:28,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:59:28,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:28" (1/1) ... [2019-12-27 21:59:28,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:28" (1/1) ... [2019-12-27 21:59:28,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:28" (1/1) ... [2019-12-27 21:59:28,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:28" (1/1) ... [2019-12-27 21:59:28,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:28" (1/1) ... [2019-12-27 21:59:28,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:28" (1/1) ... [2019-12-27 21:59:28,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:28" (1/1) ... [2019-12-27 21:59:28,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:59:28,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:59:28,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:59:28,132 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:59:28,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:59:28,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:59:28,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:59:28,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:59:28,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:59:28,201 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:59:28,201 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:59:28,201 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:59:28,201 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:59:28,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:59:28,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:59:28,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:59:28,204 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:59:28,915 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:59:28,916 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:59:28,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:59:28 BoogieIcfgContainer [2019-12-27 21:59:28,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:59:28,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:59:28,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:59:28,923 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:59:28,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:59:27" (1/3) ... [2019-12-27 21:59:28,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1364b00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:59:28, skipping insertion in model container [2019-12-27 21:59:28,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:28" (2/3) ... [2019-12-27 21:59:28,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1364b00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:59:28, skipping insertion in model container [2019-12-27 21:59:28,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:59:28" (3/3) ... [2019-12-27 21:59:28,927 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_pso.opt.i [2019-12-27 21:59:28,939 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:59:28,939 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:59:28,955 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:59:28,956 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:59:29,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,015 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,015 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,015 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,016 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,016 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,026 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,026 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,060 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,061 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,061 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,086 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,089 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:29,105 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:59:29,127 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:59:29,127 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:59:29,127 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:59:29,127 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:59:29,127 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:59:29,128 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:59:29,128 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:59:29,128 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:59:29,146 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 21:59:29,148 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 21:59:29,236 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 21:59:29,236 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:59:29,251 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:59:29,271 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 21:59:29,318 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 21:59:29,318 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:59:29,325 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:59:29,340 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 21:59:29,341 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:59:32,466 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 21:59:32,571 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 21:59:32,662 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50908 [2019-12-27 21:59:32,662 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-27 21:59:32,666 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 90 transitions [2019-12-27 21:59:33,197 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9707 states. [2019-12-27 21:59:33,199 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states. [2019-12-27 21:59:33,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:59:33,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:33,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:59:33,207 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:33,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:33,213 INFO L82 PathProgramCache]: Analyzing trace with hash 787412, now seen corresponding path program 1 times [2019-12-27 21:59:33,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:33,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314405215] [2019-12-27 21:59:33,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:59:33,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314405215] [2019-12-27 21:59:33,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:33,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:59:33,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [302731751] [2019-12-27 21:59:33,446 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:33,452 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:33,465 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:59:33,465 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:33,470 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:33,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:59:33,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:33,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:59:33,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:33,489 INFO L87 Difference]: Start difference. First operand 9707 states. Second operand 3 states. [2019-12-27 21:59:33,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:33,721 INFO L93 Difference]: Finished difference Result 9421 states and 30351 transitions. [2019-12-27 21:59:33,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:59:33,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:59:33,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:33,812 INFO L225 Difference]: With dead ends: 9421 [2019-12-27 21:59:33,813 INFO L226 Difference]: Without dead ends: 8862 [2019-12-27 21:59:33,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:33,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8862 states. [2019-12-27 21:59:34,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8862 to 8862. [2019-12-27 21:59:34,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8862 states. [2019-12-27 21:59:34,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8862 states to 8862 states and 28501 transitions. [2019-12-27 21:59:34,332 INFO L78 Accepts]: Start accepts. Automaton has 8862 states and 28501 transitions. Word has length 3 [2019-12-27 21:59:34,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:34,332 INFO L462 AbstractCegarLoop]: Abstraction has 8862 states and 28501 transitions. [2019-12-27 21:59:34,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:59:34,332 INFO L276 IsEmpty]: Start isEmpty. Operand 8862 states and 28501 transitions. [2019-12-27 21:59:34,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:59:34,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:34,336 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:34,336 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:34,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:34,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1755658876, now seen corresponding path program 1 times [2019-12-27 21:59:34,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:34,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350226780] [2019-12-27 21:59:34,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:34,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:59:34,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350226780] [2019-12-27 21:59:34,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:34,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:59:34,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1298515098] [2019-12-27 21:59:34,490 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:34,492 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:34,495 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:59:34,495 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:34,495 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:34,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:59:34,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:34,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:59:34,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:59:34,499 INFO L87 Difference]: Start difference. First operand 8862 states and 28501 transitions. Second operand 4 states. [2019-12-27 21:59:34,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:34,902 INFO L93 Difference]: Finished difference Result 13396 states and 41079 transitions. [2019-12-27 21:59:34,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:59:34,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:59:34,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:34,970 INFO L225 Difference]: With dead ends: 13396 [2019-12-27 21:59:34,970 INFO L226 Difference]: Without dead ends: 13389 [2019-12-27 21:59:34,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:59:35,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13389 states. [2019-12-27 21:59:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13389 to 12015. [2019-12-27 21:59:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12015 states. [2019-12-27 21:59:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12015 states to 12015 states and 37536 transitions. [2019-12-27 21:59:35,967 INFO L78 Accepts]: Start accepts. Automaton has 12015 states and 37536 transitions. Word has length 11 [2019-12-27 21:59:35,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:35,968 INFO L462 AbstractCegarLoop]: Abstraction has 12015 states and 37536 transitions. [2019-12-27 21:59:35,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:59:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 12015 states and 37536 transitions. [2019-12-27 21:59:35,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:59:35,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:35,974 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:35,974 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:35,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:35,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1550555126, now seen corresponding path program 1 times [2019-12-27 21:59:35,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:35,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139784472] [2019-12-27 21:59:35,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:36,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:59:36,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139784472] [2019-12-27 21:59:36,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:36,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:59:36,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1613115069] [2019-12-27 21:59:36,055 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:36,057 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:36,061 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:59:36,061 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:36,061 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:36,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:59:36,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:36,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:59:36,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:59:36,062 INFO L87 Difference]: Start difference. First operand 12015 states and 37536 transitions. Second operand 4 states. [2019-12-27 21:59:36,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:36,312 INFO L93 Difference]: Finished difference Result 14164 states and 44146 transitions. [2019-12-27 21:59:36,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:59:36,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 21:59:36,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:36,359 INFO L225 Difference]: With dead ends: 14164 [2019-12-27 21:59:36,359 INFO L226 Difference]: Without dead ends: 14164 [2019-12-27 21:59:36,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:59:36,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14164 states. [2019-12-27 21:59:36,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14164 to 12676. [2019-12-27 21:59:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12676 states. [2019-12-27 21:59:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12676 states to 12676 states and 39720 transitions. [2019-12-27 21:59:36,893 INFO L78 Accepts]: Start accepts. Automaton has 12676 states and 39720 transitions. Word has length 14 [2019-12-27 21:59:36,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:36,900 INFO L462 AbstractCegarLoop]: Abstraction has 12676 states and 39720 transitions. [2019-12-27 21:59:36,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:59:36,901 INFO L276 IsEmpty]: Start isEmpty. Operand 12676 states and 39720 transitions. [2019-12-27 21:59:36,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:59:36,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:36,907 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:36,907 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:36,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:36,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1838903681, now seen corresponding path program 1 times [2019-12-27 21:59:36,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:36,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995692929] [2019-12-27 21:59:36,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:37,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:59:37,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995692929] [2019-12-27 21:59:37,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:37,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:59:37,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1048347203] [2019-12-27 21:59:37,026 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:37,029 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:37,031 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 21:59:37,031 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:37,033 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:37,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:59:37,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:37,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:59:37,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:37,034 INFO L87 Difference]: Start difference. First operand 12676 states and 39720 transitions. Second operand 3 states. [2019-12-27 21:59:37,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:37,099 INFO L93 Difference]: Finished difference Result 12673 states and 39711 transitions. [2019-12-27 21:59:37,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:59:37,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 21:59:37,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:37,147 INFO L225 Difference]: With dead ends: 12673 [2019-12-27 21:59:37,147 INFO L226 Difference]: Without dead ends: 12673 [2019-12-27 21:59:37,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:37,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12673 states. [2019-12-27 21:59:37,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12673 to 12673. [2019-12-27 21:59:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12673 states. [2019-12-27 21:59:37,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12673 states to 12673 states and 39711 transitions. [2019-12-27 21:59:37,625 INFO L78 Accepts]: Start accepts. Automaton has 12673 states and 39711 transitions. Word has length 16 [2019-12-27 21:59:37,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:37,626 INFO L462 AbstractCegarLoop]: Abstraction has 12673 states and 39711 transitions. [2019-12-27 21:59:37,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:59:37,626 INFO L276 IsEmpty]: Start isEmpty. Operand 12673 states and 39711 transitions. [2019-12-27 21:59:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:59:37,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:37,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:37,631 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:37,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:37,631 INFO L82 PathProgramCache]: Analyzing trace with hash -601685409, now seen corresponding path program 1 times [2019-12-27 21:59:37,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:37,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353758895] [2019-12-27 21:59:37,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:37,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:59:37,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353758895] [2019-12-27 21:59:37,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:37,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:59:37,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [909630397] [2019-12-27 21:59:37,677 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:37,680 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:37,683 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:59:37,683 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:37,684 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:37,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:59:37,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:37,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:59:37,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:37,685 INFO L87 Difference]: Start difference. First operand 12673 states and 39711 transitions. Second operand 3 states. [2019-12-27 21:59:37,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:37,777 INFO L93 Difference]: Finished difference Result 21543 states and 67050 transitions. [2019-12-27 21:59:37,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:59:37,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 21:59:37,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:37,813 INFO L225 Difference]: With dead ends: 21543 [2019-12-27 21:59:37,813 INFO L226 Difference]: Without dead ends: 12171 [2019-12-27 21:59:37,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:37,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-12-27 21:59:38,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 11475. [2019-12-27 21:59:38,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11475 states. [2019-12-27 21:59:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11475 states to 11475 states and 34983 transitions. [2019-12-27 21:59:38,944 INFO L78 Accepts]: Start accepts. Automaton has 11475 states and 34983 transitions. Word has length 17 [2019-12-27 21:59:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:38,945 INFO L462 AbstractCegarLoop]: Abstraction has 11475 states and 34983 transitions. [2019-12-27 21:59:38,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:59:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 11475 states and 34983 transitions. [2019-12-27 21:59:38,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:59:38,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:38,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:38,952 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:38,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:38,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1176802527, now seen corresponding path program 1 times [2019-12-27 21:59:38,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:38,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778499328] [2019-12-27 21:59:38,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:59:39,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778499328] [2019-12-27 21:59:39,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:39,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:59:39,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [273098164] [2019-12-27 21:59:39,032 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:39,035 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:39,039 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:59:39,039 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:39,039 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:39,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:59:39,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:39,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:59:39,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:39,040 INFO L87 Difference]: Start difference. First operand 11475 states and 34983 transitions. Second operand 3 states. [2019-12-27 21:59:39,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:39,092 INFO L93 Difference]: Finished difference Result 10927 states and 32734 transitions. [2019-12-27 21:59:39,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:59:39,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 21:59:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:39,115 INFO L225 Difference]: With dead ends: 10927 [2019-12-27 21:59:39,115 INFO L226 Difference]: Without dead ends: 10927 [2019-12-27 21:59:39,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:39,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10927 states. [2019-12-27 21:59:39,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10927 to 10919. [2019-12-27 21:59:39,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10919 states. [2019-12-27 21:59:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10919 states to 10919 states and 32718 transitions. [2019-12-27 21:59:39,393 INFO L78 Accepts]: Start accepts. Automaton has 10919 states and 32718 transitions. Word has length 17 [2019-12-27 21:59:39,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:39,394 INFO L462 AbstractCegarLoop]: Abstraction has 10919 states and 32718 transitions. [2019-12-27 21:59:39,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:59:39,394 INFO L276 IsEmpty]: Start isEmpty. Operand 10919 states and 32718 transitions. [2019-12-27 21:59:39,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:59:39,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:39,399 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:39,400 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:39,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:39,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1916399741, now seen corresponding path program 1 times [2019-12-27 21:59:39,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:39,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140429636] [2019-12-27 21:59:39,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:59:39,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140429636] [2019-12-27 21:59:39,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:39,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:59:39,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1484858162] [2019-12-27 21:59:39,466 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:39,468 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:39,472 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 31 transitions. [2019-12-27 21:59:39,472 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:39,473 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:39,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:59:39,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:39,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:59:39,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:59:39,474 INFO L87 Difference]: Start difference. First operand 10919 states and 32718 transitions. Second operand 4 states. [2019-12-27 21:59:39,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:39,508 INFO L93 Difference]: Finished difference Result 1855 states and 4482 transitions. [2019-12-27 21:59:39,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:59:39,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 21:59:39,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:39,511 INFO L225 Difference]: With dead ends: 1855 [2019-12-27 21:59:39,511 INFO L226 Difference]: Without dead ends: 1321 [2019-12-27 21:59:39,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:59:39,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-12-27 21:59:39,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2019-12-27 21:59:39,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2019-12-27 21:59:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 2836 transitions. [2019-12-27 21:59:39,531 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 2836 transitions. Word has length 17 [2019-12-27 21:59:39,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:39,532 INFO L462 AbstractCegarLoop]: Abstraction has 1321 states and 2836 transitions. [2019-12-27 21:59:39,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:59:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 2836 transitions. [2019-12-27 21:59:39,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:59:39,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:39,534 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:39,534 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:39,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:39,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2091906228, now seen corresponding path program 1 times [2019-12-27 21:59:39,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:39,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932109583] [2019-12-27 21:59:39,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:39,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:59:39,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932109583] [2019-12-27 21:59:39,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:39,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:59:39,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [756697870] [2019-12-27 21:59:39,608 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:39,612 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:39,618 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:59:39,618 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:39,619 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:39,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:59:39,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:39,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:59:39,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:59:39,620 INFO L87 Difference]: Start difference. First operand 1321 states and 2836 transitions. Second operand 6 states. [2019-12-27 21:59:40,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:40,156 INFO L93 Difference]: Finished difference Result 3692 states and 7831 transitions. [2019-12-27 21:59:40,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:59:40,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 21:59:40,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:40,161 INFO L225 Difference]: With dead ends: 3692 [2019-12-27 21:59:40,162 INFO L226 Difference]: Without dead ends: 3657 [2019-12-27 21:59:40,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:59:40,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3657 states. [2019-12-27 21:59:40,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3657 to 1802. [2019-12-27 21:59:40,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2019-12-27 21:59:40,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 3967 transitions. [2019-12-27 21:59:40,221 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 3967 transitions. Word has length 25 [2019-12-27 21:59:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:40,222 INFO L462 AbstractCegarLoop]: Abstraction has 1802 states and 3967 transitions. [2019-12-27 21:59:40,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:59:40,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 3967 transitions. [2019-12-27 21:59:40,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:59:40,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:40,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:40,225 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:40,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:40,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1541096581, now seen corresponding path program 1 times [2019-12-27 21:59:40,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:40,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88124863] [2019-12-27 21:59:40,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:40,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:59:40,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88124863] [2019-12-27 21:59:40,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:40,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:59:40,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2094739888] [2019-12-27 21:59:40,302 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:40,307 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:40,314 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 21:59:40,314 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:40,315 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:40,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:59:40,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:40,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:59:40,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:59:40,316 INFO L87 Difference]: Start difference. First operand 1802 states and 3967 transitions. Second operand 6 states. [2019-12-27 21:59:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:40,756 INFO L93 Difference]: Finished difference Result 3339 states and 7076 transitions. [2019-12-27 21:59:40,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:59:40,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 21:59:40,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:40,761 INFO L225 Difference]: With dead ends: 3339 [2019-12-27 21:59:40,762 INFO L226 Difference]: Without dead ends: 3310 [2019-12-27 21:59:40,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:59:40,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2019-12-27 21:59:40,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 1781. [2019-12-27 21:59:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1781 states. [2019-12-27 21:59:40,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 3928 transitions. [2019-12-27 21:59:40,793 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 3928 transitions. Word has length 26 [2019-12-27 21:59:40,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:40,793 INFO L462 AbstractCegarLoop]: Abstraction has 1781 states and 3928 transitions. [2019-12-27 21:59:40,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:59:40,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 3928 transitions. [2019-12-27 21:59:40,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 21:59:40,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:40,796 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:40,796 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:40,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:40,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1084312717, now seen corresponding path program 1 times [2019-12-27 21:59:40,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:40,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852445320] [2019-12-27 21:59:40,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:59:40,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852445320] [2019-12-27 21:59:40,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:40,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:59:40,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [832158031] [2019-12-27 21:59:40,878 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:40,883 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:40,898 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 21:59:40,898 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:40,948 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:59:40,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:59:40,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:40,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:59:40,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:59:40,949 INFO L87 Difference]: Start difference. First operand 1781 states and 3928 transitions. Second operand 6 states. [2019-12-27 21:59:40,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:40,992 INFO L93 Difference]: Finished difference Result 916 states and 1977 transitions. [2019-12-27 21:59:40,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:59:40,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 21:59:40,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:40,994 INFO L225 Difference]: With dead ends: 916 [2019-12-27 21:59:40,994 INFO L226 Difference]: Without dead ends: 744 [2019-12-27 21:59:40,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:59:40,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-12-27 21:59:41,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2019-12-27 21:59:41,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-12-27 21:59:41,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1655 transitions. [2019-12-27 21:59:41,007 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1655 transitions. Word has length 28 [2019-12-27 21:59:41,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:41,007 INFO L462 AbstractCegarLoop]: Abstraction has 744 states and 1655 transitions. [2019-12-27 21:59:41,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:59:41,007 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1655 transitions. [2019-12-27 21:59:41,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:59:41,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:41,010 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:41,010 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:41,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:41,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1928000048, now seen corresponding path program 1 times [2019-12-27 21:59:41,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:41,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304384152] [2019-12-27 21:59:41,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:59:41,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304384152] [2019-12-27 21:59:41,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:41,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:59:41,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [30264961] [2019-12-27 21:59:41,102 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:41,118 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:41,190 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 104 states and 153 transitions. [2019-12-27 21:59:41,190 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:41,251 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:59:41,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:59:41,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:41,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:59:41,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:59:41,252 INFO L87 Difference]: Start difference. First operand 744 states and 1655 transitions. Second operand 8 states. [2019-12-27 21:59:41,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:41,541 INFO L93 Difference]: Finished difference Result 1483 states and 3211 transitions. [2019-12-27 21:59:41,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:59:41,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-27 21:59:41,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:41,544 INFO L225 Difference]: With dead ends: 1483 [2019-12-27 21:59:41,544 INFO L226 Difference]: Without dead ends: 990 [2019-12-27 21:59:41,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:59:41,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-12-27 21:59:41,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 819. [2019-12-27 21:59:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-12-27 21:59:41,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1780 transitions. [2019-12-27 21:59:41,557 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1780 transitions. Word has length 52 [2019-12-27 21:59:41,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:41,557 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 1780 transitions. [2019-12-27 21:59:41,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:59:41,558 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1780 transitions. [2019-12-27 21:59:41,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:59:41,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:41,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:41,561 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:41,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:41,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1603502286, now seen corresponding path program 2 times [2019-12-27 21:59:41,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:41,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027280014] [2019-12-27 21:59:41,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:41,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:59:41,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027280014] [2019-12-27 21:59:41,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:41,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:59:41,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [35677387] [2019-12-27 21:59:41,686 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:41,703 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:41,780 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 158 transitions. [2019-12-27 21:59:41,781 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:41,795 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:59:41,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:59:41,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:41,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:59:41,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:41,796 INFO L87 Difference]: Start difference. First operand 819 states and 1780 transitions. Second operand 3 states. [2019-12-27 21:59:41,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:41,849 INFO L93 Difference]: Finished difference Result 1035 states and 2229 transitions. [2019-12-27 21:59:41,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:59:41,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:59:41,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:41,851 INFO L225 Difference]: With dead ends: 1035 [2019-12-27 21:59:41,851 INFO L226 Difference]: Without dead ends: 1035 [2019-12-27 21:59:41,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:41,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-12-27 21:59:41,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 733. [2019-12-27 21:59:41,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-12-27 21:59:41,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1576 transitions. [2019-12-27 21:59:41,868 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1576 transitions. Word has length 52 [2019-12-27 21:59:41,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:41,868 INFO L462 AbstractCegarLoop]: Abstraction has 733 states and 1576 transitions. [2019-12-27 21:59:41,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:59:41,869 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1576 transitions. [2019-12-27 21:59:41,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:59:41,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:41,871 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:41,871 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:41,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:41,871 INFO L82 PathProgramCache]: Analyzing trace with hash -637525615, now seen corresponding path program 1 times [2019-12-27 21:59:41,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:41,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351243906] [2019-12-27 21:59:41,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:59:41,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351243906] [2019-12-27 21:59:41,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:41,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:59:41,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [904094518] [2019-12-27 21:59:41,917 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:41,934 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:42,008 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 112 states and 161 transitions. [2019-12-27 21:59:42,008 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:42,009 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:42,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:59:42,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:42,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:59:42,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:42,010 INFO L87 Difference]: Start difference. First operand 733 states and 1576 transitions. Second operand 3 states. [2019-12-27 21:59:42,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:42,045 INFO L93 Difference]: Finished difference Result 821 states and 1710 transitions. [2019-12-27 21:59:42,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:59:42,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 21:59:42,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:42,048 INFO L225 Difference]: With dead ends: 821 [2019-12-27 21:59:42,048 INFO L226 Difference]: Without dead ends: 821 [2019-12-27 21:59:42,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2019-12-27 21:59:42,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 670. [2019-12-27 21:59:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-27 21:59:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1434 transitions. [2019-12-27 21:59:42,060 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1434 transitions. Word has length 53 [2019-12-27 21:59:42,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:42,061 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1434 transitions. [2019-12-27 21:59:42,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:59:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1434 transitions. [2019-12-27 21:59:42,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:59:42,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:42,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:42,067 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:42,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:42,067 INFO L82 PathProgramCache]: Analyzing trace with hash -616115185, now seen corresponding path program 1 times [2019-12-27 21:59:42,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:42,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285974938] [2019-12-27 21:59:42,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:59:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:59:42,179 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:59:42,180 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:59:42,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_45| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1711~0.base_22| 4)) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_cnt~0_15) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1711~0.base_22|) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~x$w_buff1~0_25) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#NULL.offset_6| 0) (= 0 |v_ULTIMATE.start_main_~#t1711~0.offset_17|) (= 0 v_~x$r_buff0_thd1~0_28) (= 0 v_~x$r_buff0_thd0~0_22) (= 0 v_~x$r_buff0_thd2~0_76) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1711~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1711~0.base_22|) |v_ULTIMATE.start_main_~#t1711~0.offset_17| 0)) |v_#memory_int_13|) (= v_~x~0_24 0) (= v_~x$flush_delayed~0_13 0) (= v_~x$w_buff1_used~0_67 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_18 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1711~0.base_22|)) (= 0 v_~x$w_buff0~0_25) (= v_~y~0_15 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~x$r_buff1_thd2~0_51 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$w_buff0_used~0_102) (= |v_#valid_43| (store .cse0 |v_ULTIMATE.start_main_~#t1711~0.base_22| 1)) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~x$r_buff1_thd0~0_19 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_25, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, #length=|v_#length_13|, ULTIMATE.start_main_~#t1711~0.base=|v_ULTIMATE.start_main_~#t1711~0.base_22|, ULTIMATE.start_main_~#t1711~0.offset=|v_ULTIMATE.start_main_~#t1711~0.offset_17|, ~y~0=v_~y~0_15, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ULTIMATE.start_main_~#t1712~0.offset=|v_ULTIMATE.start_main_~#t1712~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_76, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ULTIMATE.start_main_~#t1712~0.base=|v_ULTIMATE.start_main_~#t1712~0.base_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_24, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1711~0.base, ULTIMATE.start_main_~#t1711~0.offset, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1712~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1712~0.base, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 21:59:42,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= v_~x$r_buff1_thd2~0_33 v_~x$r_buff0_thd2~0_56) (= v_~x$r_buff1_thd1~0_11 v_~x$r_buff0_thd1~0_17) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_14) (= 1 v_~y~0_5) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= 1 v_~x$r_buff0_thd1~0_16)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_17, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_56} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_11, ~y~0=v_~y~0_5, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_56, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 21:59:42,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L797-1-->L799: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1712~0.base_12| 1) |v_#valid_27|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1712~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1712~0.base_12| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1712~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t1712~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t1712~0.offset_10|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1712~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1712~0.base_12|) |v_ULTIMATE.start_main_~#t1712~0.offset_10| 1)) |v_#memory_int_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1712~0.base=|v_ULTIMATE.start_main_~#t1712~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1712~0.offset=|v_ULTIMATE.start_main_~#t1712~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1712~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1712~0.offset] because there is no mapped edge [2019-12-27 21:59:42,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In955068142 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In955068142 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out955068142| ~x$w_buff0_used~0_In955068142)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out955068142| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In955068142, ~x$w_buff0_used~0=~x$w_buff0_used~0_In955068142} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out955068142|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In955068142, ~x$w_buff0_used~0=~x$w_buff0_used~0_In955068142} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:59:42,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-740557754 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out-740557754| |P1Thread1of1ForFork1_#t~ite15_Out-740557754|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-740557754 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-740557754 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-740557754 256)) .cse1) (and (= (mod ~x$r_buff1_thd2~0_In-740557754 256) 0) .cse1))) (= ~x$w_buff0~0_In-740557754 |P1Thread1of1ForFork1_#t~ite14_Out-740557754|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In-740557754| |P1Thread1of1ForFork1_#t~ite14_Out-740557754|) (= ~x$w_buff0~0_In-740557754 |P1Thread1of1ForFork1_#t~ite15_Out-740557754|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-740557754, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-740557754, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-740557754, ~weak$$choice2~0=~weak$$choice2~0_In-740557754, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-740557754, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-740557754|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-740557754} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-740557754, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-740557754, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-740557754, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-740557754|, ~weak$$choice2~0=~weak$$choice2~0_In-740557754, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-740557754, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-740557754|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-740557754} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 21:59:42,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L764-->L764-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1580660906 256)))) (or (and (= ~x$w_buff1~0_In-1580660906 |P1Thread1of1ForFork1_#t~ite17_Out-1580660906|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1580660906 256)))) (or (and (= 0 (mod ~x$r_buff1_thd2~0_In-1580660906 256)) .cse0) (and (= 0 (mod ~x$w_buff1_used~0_In-1580660906 256)) .cse0) (= (mod ~x$w_buff0_used~0_In-1580660906 256) 0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite18_Out-1580660906| |P1Thread1of1ForFork1_#t~ite17_Out-1580660906|)) (and (= |P1Thread1of1ForFork1_#t~ite17_In-1580660906| |P1Thread1of1ForFork1_#t~ite17_Out-1580660906|) (= |P1Thread1of1ForFork1_#t~ite18_Out-1580660906| ~x$w_buff1~0_In-1580660906) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1580660906, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1580660906, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1580660906, ~weak$$choice2~0=~weak$$choice2~0_In-1580660906, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1580660906, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1580660906|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1580660906} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1580660906|, ~x$w_buff1~0=~x$w_buff1~0_In-1580660906, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1580660906, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1580660906, ~weak$$choice2~0=~weak$$choice2~0_In-1580660906, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1580660906, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1580660906|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1580660906} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 21:59:42,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1126714947 256) 0))) (or (and (not .cse0) (= ~x$w_buff0_used~0_In1126714947 |P1Thread1of1ForFork1_#t~ite21_Out1126714947|) (= |P1Thread1of1ForFork1_#t~ite20_In1126714947| |P1Thread1of1ForFork1_#t~ite20_Out1126714947|)) (and .cse0 (= ~x$w_buff0_used~0_In1126714947 |P1Thread1of1ForFork1_#t~ite20_Out1126714947|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1126714947 256)))) (or (and (= 0 (mod ~x$r_buff1_thd2~0_In1126714947 256)) .cse1) (= (mod ~x$w_buff0_used~0_In1126714947 256) 0) (and (= (mod ~x$w_buff1_used~0_In1126714947 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite21_Out1126714947| |P1Thread1of1ForFork1_#t~ite20_Out1126714947|)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1126714947|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1126714947, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1126714947, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1126714947, ~weak$$choice2~0=~weak$$choice2~0_In1126714947, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1126714947} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1126714947|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1126714947, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1126714947, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1126714947|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1126714947, ~weak$$choice2~0=~weak$$choice2~0_In1126714947, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1126714947} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 21:59:42,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd1~0_In45425752 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In45425752 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In45425752 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In45425752 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In45425752 |P0Thread1of1ForFork0_#t~ite6_Out45425752|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite6_Out45425752| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In45425752, ~x$w_buff1_used~0=~x$w_buff1_used~0_In45425752, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In45425752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In45425752} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out45425752|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In45425752, ~x$w_buff1_used~0=~x$w_buff1_used~0_In45425752, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In45425752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In45425752} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:59:42,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In2102131667 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In2102131667 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd1~0_Out2102131667)) (and (= ~x$r_buff0_thd1~0_Out2102131667 ~x$r_buff0_thd1~0_In2102131667) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2102131667, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2102131667} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out2102131667, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out2102131667|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2102131667} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 21:59:42,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-1380056516 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1380056516 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1380056516 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1380056516 256)))) (or (and (= ~x$r_buff1_thd1~0_In-1380056516 |P0Thread1of1ForFork0_#t~ite8_Out-1380056516|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1380056516|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1380056516, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1380056516, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1380056516, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1380056516} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1380056516, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1380056516|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1380056516, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1380056516, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1380056516} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:59:42,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L742-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 21:59:42,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd2~0_60 v_~x$r_buff0_thd2~0_59)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_19, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 21:59:42,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L768-->L768-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1299643516 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out1299643516| ~x$r_buff1_thd2~0_In1299643516) (= |P1Thread1of1ForFork1_#t~ite29_Out1299643516| |P1Thread1of1ForFork1_#t~ite30_Out1299643516|) (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1299643516 256) 0))) (or (and .cse0 (= (mod ~x$w_buff1_used~0_In1299643516 256) 0)) (and .cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1299643516 256))) (= 0 (mod ~x$w_buff0_used~0_In1299643516 256)))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite29_In1299643516| |P1Thread1of1ForFork1_#t~ite29_Out1299643516|) (not .cse1) (= ~x$r_buff1_thd2~0_In1299643516 |P1Thread1of1ForFork1_#t~ite30_Out1299643516|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1299643516|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1299643516, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1299643516, ~weak$$choice2~0=~weak$$choice2~0_In1299643516, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1299643516, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1299643516} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1299643516|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1299643516|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1299643516, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1299643516, ~weak$$choice2~0=~weak$$choice2~0_In1299643516, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1299643516, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1299643516} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 21:59:42,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-27 21:59:42,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1951114773 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1951114773 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1951114773| ~x~0_In1951114773)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1951114773| ~x$w_buff1~0_In1951114773) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1951114773, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1951114773, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1951114773, ~x~0=~x~0_In1951114773} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1951114773, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1951114773, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1951114773, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1951114773|, ~x~0=~x~0_In1951114773} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 21:59:42,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_16 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 21:59:42,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1470504706 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1470504706 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1470504706|)) (and (= ~x$w_buff0_used~0_In1470504706 |P1Thread1of1ForFork1_#t~ite34_Out1470504706|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1470504706, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1470504706} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1470504706|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1470504706, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1470504706} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 21:59:42,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1305380360 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1305380360 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1305380360 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-1305380360 256) 0))) (or (and (= ~x$w_buff1_used~0_In-1305380360 |P1Thread1of1ForFork1_#t~ite35_Out-1305380360|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1305380360|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1305380360, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1305380360, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1305380360, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1305380360} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1305380360, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1305380360, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1305380360|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1305380360, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1305380360} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 21:59:42,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-508082330 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-508082330 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In-508082330 |P1Thread1of1ForFork1_#t~ite36_Out-508082330|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-508082330|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-508082330, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-508082330} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-508082330, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-508082330|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-508082330} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 21:59:42,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In956059601 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In956059601 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In956059601 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In956059601 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out956059601| 0)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out956059601| ~x$r_buff1_thd2~0_In956059601) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In956059601, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In956059601, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In956059601, ~x$w_buff0_used~0=~x$w_buff0_used~0_In956059601} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In956059601, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In956059601, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In956059601, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out956059601|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In956059601} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:59:42,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_44 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:59:42,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~x$w_buff0_used~0_83 256) 0) (= 0 (mod v_~x$r_buff0_thd0~0_17 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 21:59:42,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1851235533 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1851235533 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1851235533| ~x$w_buff1~0_In1851235533) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1851235533| ~x~0_In1851235533) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1851235533, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1851235533, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1851235533, ~x~0=~x~0_In1851235533} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1851235533|, ~x$w_buff1~0=~x$w_buff1~0_In1851235533, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1851235533, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1851235533, ~x~0=~x~0_In1851235533} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:59:42,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-27 21:59:42,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1027988065 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1027988065 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out1027988065| ~x$w_buff0_used~0_In1027988065)) (and (= |ULTIMATE.start_main_#t~ite42_Out1027988065| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1027988065, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1027988065} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1027988065, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1027988065|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1027988065} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:59:42,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-360294425 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-360294425 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-360294425 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-360294425 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-360294425|)) (and (= |ULTIMATE.start_main_#t~ite43_Out-360294425| ~x$w_buff1_used~0_In-360294425) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-360294425, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-360294425, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-360294425, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-360294425} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-360294425, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-360294425, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-360294425|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-360294425, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-360294425} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 21:59:42,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1427341982 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1427341982 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1427341982| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1427341982| ~x$r_buff0_thd0~0_In1427341982) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1427341982, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1427341982} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1427341982, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1427341982|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1427341982} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:59:42,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1888810740 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1888810740 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1888810740 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-1888810740 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-1888810740| 0)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1888810740| ~x$r_buff1_thd0~0_In-1888810740) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1888810740, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1888810740, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1888810740, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1888810740} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1888810740, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1888810740, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1888810740, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1888810740|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1888810740} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 21:59:42,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite45_14|) (= v_~main$tmp_guard1~0_12 0) (= v_~__unbuffered_p1_EBX~0_10 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y~0_13 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~y~0=v_~y~0_13, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_13, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:59:42,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:59:42 BasicIcfg [2019-12-27 21:59:42,286 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:59:42,290 INFO L168 Benchmark]: Toolchain (without parser) took 15083.52 ms. Allocated memory was 144.2 MB in the beginning and 799.5 MB in the end (delta: 655.4 MB). Free memory was 101.7 MB in the beginning and 316.3 MB in the end (delta: -214.7 MB). Peak memory consumption was 440.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:59:42,291 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.2 MB. Free memory was 121.3 MB in the beginning and 121.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 21:59:42,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 799.43 ms. Allocated memory was 144.2 MB in the beginning and 202.9 MB in the end (delta: 58.7 MB). Free memory was 101.3 MB in the beginning and 157.5 MB in the end (delta: -56.2 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:59:42,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.75 ms. Allocated memory is still 202.9 MB. Free memory was 157.5 MB in the beginning and 155.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:59:42,295 INFO L168 Benchmark]: Boogie Preprocessor took 62.57 ms. Allocated memory is still 202.9 MB. Free memory was 155.4 MB in the beginning and 152.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:59:42,296 INFO L168 Benchmark]: RCFGBuilder took 786.66 ms. Allocated memory is still 202.9 MB. Free memory was 152.6 MB in the beginning and 108.6 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:59:42,297 INFO L168 Benchmark]: TraceAbstraction took 13366.93 ms. Allocated memory was 202.9 MB in the beginning and 799.5 MB in the end (delta: 596.6 MB). Free memory was 108.6 MB in the beginning and 316.3 MB in the end (delta: -207.7 MB). Peak memory consumption was 388.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:59:42,310 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 144.2 MB. Free memory was 121.3 MB in the beginning and 121.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 799.43 ms. Allocated memory was 144.2 MB in the beginning and 202.9 MB in the end (delta: 58.7 MB). Free memory was 101.3 MB in the beginning and 157.5 MB in the end (delta: -56.2 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.75 ms. Allocated memory is still 202.9 MB. Free memory was 157.5 MB in the beginning and 155.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.57 ms. Allocated memory is still 202.9 MB. Free memory was 155.4 MB in the beginning and 152.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 786.66 ms. Allocated memory is still 202.9 MB. Free memory was 152.6 MB in the beginning and 108.6 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13366.93 ms. Allocated memory was 202.9 MB in the beginning and 799.5 MB in the end (delta: 596.6 MB). Free memory was 108.6 MB in the beginning and 316.3 MB in the end (delta: -207.7 MB). Peak memory consumption was 388.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 147 ProgramPointsBefore, 80 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4527 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50908 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1711, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1712, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.0s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1531 SDtfs, 1624 SDslu, 2459 SDs, 0 SdLazy, 1174 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 9 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12676occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 7574 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 26150 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...