/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:27:05,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:27:05,086 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:27:05,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:27:05,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:27:05,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:27:05,100 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:27:05,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:27:05,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:27:05,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:27:05,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:27:05,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:27:05,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:27:05,108 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:27:05,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:27:05,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:27:05,110 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:27:05,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:27:05,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:27:05,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:27:05,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:27:05,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:27:05,119 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:27:05,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:27:05,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:27:05,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:27:05,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:27:05,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:27:05,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:27:05,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:27:05,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:27:05,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:27:05,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:27:05,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:27:05,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:27:05,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:27:05,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:27:05,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:27:05,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:27:05,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:27:05,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:27:05,132 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-SemanticLbe.epf [2019-12-27 01:27:05,147 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:27:05,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:27:05,148 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:27:05,148 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:27:05,148 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:27:05,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:27:05,149 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:27:05,149 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:27:05,149 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:27:05,149 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:27:05,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:27:05,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:27:05,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:27:05,150 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:27:05,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:27:05,150 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:27:05,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:27:05,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:27:05,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:27:05,151 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:27:05,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:27:05,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:27:05,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:27:05,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:27:05,152 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:27:05,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:27:05,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:27:05,153 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:27:05,153 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:27:05,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:27:05,470 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:27:05,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:27:05,475 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:27:05,476 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:27:05,477 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_power.opt.i [2019-12-27 01:27:05,552 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/108d4b2f7/b4eabc219392400a8093e88075267222/FLAG04f1d6e0b [2019-12-27 01:27:06,143 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:27:06,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.opt.i [2019-12-27 01:27:06,164 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/108d4b2f7/b4eabc219392400a8093e88075267222/FLAG04f1d6e0b [2019-12-27 01:27:06,380 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/108d4b2f7/b4eabc219392400a8093e88075267222 [2019-12-27 01:27:06,390 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:27:06,392 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:27:06,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:27:06,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:27:06,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:27:06,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:27:06" (1/1) ... [2019-12-27 01:27:06,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:06, skipping insertion in model container [2019-12-27 01:27:06,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:27:06" (1/1) ... [2019-12-27 01:27:06,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:27:06,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:27:06,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:27:07,004 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:27:07,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:27:07,180 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:27:07,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:07 WrapperNode [2019-12-27 01:27:07,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:27:07,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:27:07,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:27:07,182 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:27:07,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:07" (1/1) ... [2019-12-27 01:27:07,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:07" (1/1) ... [2019-12-27 01:27:07,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:27:07,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:27:07,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:27:07,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:27:07,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:07" (1/1) ... [2019-12-27 01:27:07,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:07" (1/1) ... [2019-12-27 01:27:07,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:07" (1/1) ... [2019-12-27 01:27:07,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:07" (1/1) ... [2019-12-27 01:27:07,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:07" (1/1) ... [2019-12-27 01:27:07,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:07" (1/1) ... [2019-12-27 01:27:07,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:07" (1/1) ... [2019-12-27 01:27:07,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:27:07,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:27:07,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:27:07,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:27:07,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:07" (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 01:27:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:27:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:27:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:27:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:27:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:27:07,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:27:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:27:07,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:27:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:27:07,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:27:07,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:27:07,395 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 01:27:08,132 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:27:08,133 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:27:08,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:27:08 BoogieIcfgContainer [2019-12-27 01:27:08,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:27:08,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:27:08,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:27:08,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:27:08,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:27:06" (1/3) ... [2019-12-27 01:27:08,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4adb4cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:27:08, skipping insertion in model container [2019-12-27 01:27:08,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:07" (2/3) ... [2019-12-27 01:27:08,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4adb4cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:27:08, skipping insertion in model container [2019-12-27 01:27:08,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:27:08" (3/3) ... [2019-12-27 01:27:08,150 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_power.opt.i [2019-12-27 01:27:08,159 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:27:08,159 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:27:08,166 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:27:08,167 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:27:08,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,205 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,205 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,205 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,206 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,206 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,216 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,216 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,250 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,250 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,251 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,258 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,261 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:08,296 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 01:27:08,315 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:27:08,315 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:27:08,315 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:27:08,315 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:27:08,315 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:27:08,315 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:27:08,316 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:27:08,316 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:27:08,333 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 01:27:08,335 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 01:27:08,424 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 01:27:08,424 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:27:08,442 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 01:27:08,463 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 01:27:08,530 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 01:27:08,530 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:27:08,536 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 01:27:08,550 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 01:27:08,551 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:27:12,732 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-12-27 01:27:13,527 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 01:27:13,647 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 01:27:13,961 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77720 [2019-12-27 01:27:13,962 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 01:27:13,966 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-27 01:27:14,504 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8912 states. [2019-12-27 01:27:14,506 INFO L276 IsEmpty]: Start isEmpty. Operand 8912 states. [2019-12-27 01:27:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:27:14,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:14,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:27:14,514 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:14,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:14,520 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-27 01:27:14,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:14,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130882000] [2019-12-27 01:27:14,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:14,754 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 01:27:14,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130882000] [2019-12-27 01:27:14,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:14,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:27:14,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769876936] [2019-12-27 01:27:14,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:14,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:14,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:14,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:14,790 INFO L87 Difference]: Start difference. First operand 8912 states. Second operand 3 states. [2019-12-27 01:27:15,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:15,090 INFO L93 Difference]: Finished difference Result 8760 states and 28314 transitions. [2019-12-27 01:27:15,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:15,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:27:15,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:15,296 INFO L225 Difference]: With dead ends: 8760 [2019-12-27 01:27:15,296 INFO L226 Difference]: Without dead ends: 7798 [2019-12-27 01:27:15,298 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 01:27:15,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2019-12-27 01:27:15,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 7798. [2019-12-27 01:27:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7798 states. [2019-12-27 01:27:15,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 25120 transitions. [2019-12-27 01:27:15,710 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 25120 transitions. Word has length 3 [2019-12-27 01:27:15,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:15,711 INFO L462 AbstractCegarLoop]: Abstraction has 7798 states and 25120 transitions. [2019-12-27 01:27:15,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:15,711 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 25120 transitions. [2019-12-27 01:27:15,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:27:15,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:15,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:15,718 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:15,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:15,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-27 01:27:15,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:15,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289484467] [2019-12-27 01:27:15,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:15,851 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 01:27:15,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289484467] [2019-12-27 01:27:15,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:15,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:27:15,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656323668] [2019-12-27 01:27:15,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:15,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:15,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:15,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:15,856 INFO L87 Difference]: Start difference. First operand 7798 states and 25120 transitions. Second operand 3 states. [2019-12-27 01:27:15,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:15,889 INFO L93 Difference]: Finished difference Result 1232 states and 2767 transitions. [2019-12-27 01:27:15,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:15,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 01:27:15,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:15,897 INFO L225 Difference]: With dead ends: 1232 [2019-12-27 01:27:15,897 INFO L226 Difference]: Without dead ends: 1232 [2019-12-27 01:27:15,899 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 01:27:15,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-27 01:27:15,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-27 01:27:15,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-27 01:27:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2767 transitions. [2019-12-27 01:27:15,935 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2767 transitions. Word has length 11 [2019-12-27 01:27:15,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:15,936 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2767 transitions. [2019-12-27 01:27:15,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2767 transitions. [2019-12-27 01:27:15,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 01:27:15,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:15,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:15,940 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:15,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:15,941 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-27 01:27:15,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:15,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006809385] [2019-12-27 01:27:15,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:16,048 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 01:27:16,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006809385] [2019-12-27 01:27:16,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:16,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:27:16,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455241544] [2019-12-27 01:27:16,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:27:16,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:16,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:27:16,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:27:16,053 INFO L87 Difference]: Start difference. First operand 1232 states and 2767 transitions. Second operand 5 states. [2019-12-27 01:27:16,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:16,357 INFO L93 Difference]: Finished difference Result 1829 states and 4038 transitions. [2019-12-27 01:27:16,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:27:16,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 01:27:16,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:16,368 INFO L225 Difference]: With dead ends: 1829 [2019-12-27 01:27:16,369 INFO L226 Difference]: Without dead ends: 1829 [2019-12-27 01:27:16,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:27:16,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-12-27 01:27:16,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1572. [2019-12-27 01:27:16,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-12-27 01:27:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 3508 transitions. [2019-12-27 01:27:16,422 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 3508 transitions. Word has length 14 [2019-12-27 01:27:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:16,422 INFO L462 AbstractCegarLoop]: Abstraction has 1572 states and 3508 transitions. [2019-12-27 01:27:16,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:27:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 3508 transitions. [2019-12-27 01:27:16,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 01:27:16,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:16,425 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] [2019-12-27 01:27:16,425 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:16,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:16,426 INFO L82 PathProgramCache]: Analyzing trace with hash 603755618, now seen corresponding path program 1 times [2019-12-27 01:27:16,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:16,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453141101] [2019-12-27 01:27:16,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:16,636 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 01:27:16,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453141101] [2019-12-27 01:27:16,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:16,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:27:16,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339253065] [2019-12-27 01:27:16,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:27:16,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:16,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:27:16,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:27:16,640 INFO L87 Difference]: Start difference. First operand 1572 states and 3508 transitions. Second operand 6 states. [2019-12-27 01:27:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:17,145 INFO L93 Difference]: Finished difference Result 2337 states and 5011 transitions. [2019-12-27 01:27:17,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 01:27:17,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 01:27:17,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:17,161 INFO L225 Difference]: With dead ends: 2337 [2019-12-27 01:27:17,162 INFO L226 Difference]: Without dead ends: 2337 [2019-12-27 01:27:17,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:27:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-12-27 01:27:17,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1705. [2019-12-27 01:27:17,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-12-27 01:27:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 3772 transitions. [2019-12-27 01:27:17,215 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 3772 transitions. Word has length 24 [2019-12-27 01:27:17,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:17,216 INFO L462 AbstractCegarLoop]: Abstraction has 1705 states and 3772 transitions. [2019-12-27 01:27:17,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:27:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 3772 transitions. [2019-12-27 01:27:17,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 01:27:17,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:17,218 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 01:27:17,219 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:17,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:17,219 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-27 01:27:17,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:17,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041161149] [2019-12-27 01:27:17,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:17,334 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 01:27:17,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041161149] [2019-12-27 01:27:17,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:17,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:27:17,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79579782] [2019-12-27 01:27:17,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:17,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:17,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:17,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:17,340 INFO L87 Difference]: Start difference. First operand 1705 states and 3772 transitions. Second operand 3 states. [2019-12-27 01:27:17,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:17,363 INFO L93 Difference]: Finished difference Result 1704 states and 3770 transitions. [2019-12-27 01:27:17,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:17,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 01:27:17,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:17,373 INFO L225 Difference]: With dead ends: 1704 [2019-12-27 01:27:17,373 INFO L226 Difference]: Without dead ends: 1704 [2019-12-27 01:27:17,374 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 01:27:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2019-12-27 01:27:17,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1704. [2019-12-27 01:27:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-27 01:27:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3770 transitions. [2019-12-27 01:27:17,409 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3770 transitions. Word has length 26 [2019-12-27 01:27:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:17,410 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 3770 transitions. [2019-12-27 01:27:17,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:17,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3770 transitions. [2019-12-27 01:27:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:27:17,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:17,413 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] [2019-12-27 01:27:17,413 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:17,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:17,413 INFO L82 PathProgramCache]: Analyzing trace with hash -691470702, now seen corresponding path program 1 times [2019-12-27 01:27:17,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:17,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450057876] [2019-12-27 01:27:17,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:17,467 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 01:27:17,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450057876] [2019-12-27 01:27:17,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:17,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:27:17,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340255860] [2019-12-27 01:27:17,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:27:17,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:17,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:27:17,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:27:17,469 INFO L87 Difference]: Start difference. First operand 1704 states and 3770 transitions. Second operand 4 states. [2019-12-27 01:27:17,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:17,495 INFO L93 Difference]: Finished difference Result 2700 states and 6022 transitions. [2019-12-27 01:27:17,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:27:17,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-27 01:27:17,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:17,502 INFO L225 Difference]: With dead ends: 2700 [2019-12-27 01:27:17,502 INFO L226 Difference]: Without dead ends: 1250 [2019-12-27 01:27:17,503 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 01:27:17,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2019-12-27 01:27:17,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1233. [2019-12-27 01:27:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-12-27 01:27:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 2691 transitions. [2019-12-27 01:27:17,528 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 2691 transitions. Word has length 27 [2019-12-27 01:27:17,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:17,528 INFO L462 AbstractCegarLoop]: Abstraction has 1233 states and 2691 transitions. [2019-12-27 01:27:17,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:27:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 2691 transitions. [2019-12-27 01:27:17,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:27:17,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:17,530 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] [2019-12-27 01:27:17,530 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:17,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:17,531 INFO L82 PathProgramCache]: Analyzing trace with hash -250638352, now seen corresponding path program 2 times [2019-12-27 01:27:17,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:17,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275680785] [2019-12-27 01:27:17,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:17,613 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 01:27:17,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275680785] [2019-12-27 01:27:17,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:17,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:27:17,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150010865] [2019-12-27 01:27:17,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:27:17,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:17,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:27:17,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:27:17,617 INFO L87 Difference]: Start difference. First operand 1233 states and 2691 transitions. Second operand 5 states. [2019-12-27 01:27:18,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:18,080 INFO L93 Difference]: Finished difference Result 1899 states and 4075 transitions. [2019-12-27 01:27:18,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:27:18,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 01:27:18,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:18,089 INFO L225 Difference]: With dead ends: 1899 [2019-12-27 01:27:18,090 INFO L226 Difference]: Without dead ends: 1899 [2019-12-27 01:27:18,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:27:18,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2019-12-27 01:27:18,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1704. [2019-12-27 01:27:18,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-27 01:27:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3701 transitions. [2019-12-27 01:27:18,126 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3701 transitions. Word has length 27 [2019-12-27 01:27:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:18,127 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 3701 transitions. [2019-12-27 01:27:18,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:27:18,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3701 transitions. [2019-12-27 01:27:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:27:18,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:18,130 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 01:27:18,130 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:18,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:18,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1889347286, now seen corresponding path program 1 times [2019-12-27 01:27:18,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:18,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276553081] [2019-12-27 01:27:18,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:18,172 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 01:27:18,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276553081] [2019-12-27 01:27:18,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:18,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:27:18,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003902879] [2019-12-27 01:27:18,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:27:18,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:18,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:27:18,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:27:18,174 INFO L87 Difference]: Start difference. First operand 1704 states and 3701 transitions. Second operand 4 states. [2019-12-27 01:27:18,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:18,189 INFO L93 Difference]: Finished difference Result 921 states and 1892 transitions. [2019-12-27 01:27:18,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:27:18,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-27 01:27:18,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:18,193 INFO L225 Difference]: With dead ends: 921 [2019-12-27 01:27:18,193 INFO L226 Difference]: Without dead ends: 824 [2019-12-27 01:27:18,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:27:18,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-12-27 01:27:18,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 782. [2019-12-27 01:27:18,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-27 01:27:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1664 transitions. [2019-12-27 01:27:18,210 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1664 transitions. Word has length 28 [2019-12-27 01:27:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:18,210 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1664 transitions. [2019-12-27 01:27:18,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:27:18,210 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1664 transitions. [2019-12-27 01:27:18,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 01:27:18,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:18,213 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] [2019-12-27 01:27:18,213 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:18,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:18,213 INFO L82 PathProgramCache]: Analyzing trace with hash -317989854, now seen corresponding path program 1 times [2019-12-27 01:27:18,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:18,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712782720] [2019-12-27 01:27:18,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:18,338 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 01:27:18,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712782720] [2019-12-27 01:27:18,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:18,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:27:18,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056966016] [2019-12-27 01:27:18,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:27:18,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:18,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:27:18,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:27:18,341 INFO L87 Difference]: Start difference. First operand 782 states and 1664 transitions. Second operand 7 states. [2019-12-27 01:27:18,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:18,540 INFO L93 Difference]: Finished difference Result 1342 states and 2781 transitions. [2019-12-27 01:27:18,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 01:27:18,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-27 01:27:18,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:18,543 INFO L225 Difference]: With dead ends: 1342 [2019-12-27 01:27:18,543 INFO L226 Difference]: Without dead ends: 903 [2019-12-27 01:27:18,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:27:18,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-27 01:27:18,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 773. [2019-12-27 01:27:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-27 01:27:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1630 transitions. [2019-12-27 01:27:18,568 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1630 transitions. Word has length 50 [2019-12-27 01:27:18,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:18,568 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1630 transitions. [2019-12-27 01:27:18,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:27:18,569 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1630 transitions. [2019-12-27 01:27:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 01:27:18,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:18,571 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] [2019-12-27 01:27:18,572 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:18,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:18,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1216040192, now seen corresponding path program 2 times [2019-12-27 01:27:18,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:18,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267836247] [2019-12-27 01:27:18,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:18,727 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 01:27:18,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267836247] [2019-12-27 01:27:18,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:18,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:27:18,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911697812] [2019-12-27 01:27:18,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:27:18,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:18,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:27:18,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:27:18,729 INFO L87 Difference]: Start difference. First operand 773 states and 1630 transitions. Second operand 7 states. [2019-12-27 01:27:19,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:19,358 INFO L93 Difference]: Finished difference Result 1033 states and 2141 transitions. [2019-12-27 01:27:19,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:27:19,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-27 01:27:19,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:19,361 INFO L225 Difference]: With dead ends: 1033 [2019-12-27 01:27:19,361 INFO L226 Difference]: Without dead ends: 1027 [2019-12-27 01:27:19,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:27:19,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-12-27 01:27:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 827. [2019-12-27 01:27:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-12-27 01:27:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1729 transitions. [2019-12-27 01:27:19,378 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1729 transitions. Word has length 50 [2019-12-27 01:27:19,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:19,379 INFO L462 AbstractCegarLoop]: Abstraction has 827 states and 1729 transitions. [2019-12-27 01:27:19,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:27:19,379 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1729 transitions. [2019-12-27 01:27:19,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 01:27:19,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:19,381 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] [2019-12-27 01:27:19,381 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:19,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:19,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1826446246, now seen corresponding path program 3 times [2019-12-27 01:27:19,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:19,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278964199] [2019-12-27 01:27:19,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:19,441 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 01:27:19,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278964199] [2019-12-27 01:27:19,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:19,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:27:19,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86463084] [2019-12-27 01:27:19,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:19,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:19,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:19,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:19,444 INFO L87 Difference]: Start difference. First operand 827 states and 1729 transitions. Second operand 3 states. [2019-12-27 01:27:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:19,489 INFO L93 Difference]: Finished difference Result 1100 states and 2305 transitions. [2019-12-27 01:27:19,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:19,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 01:27:19,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:19,492 INFO L225 Difference]: With dead ends: 1100 [2019-12-27 01:27:19,492 INFO L226 Difference]: Without dead ends: 1100 [2019-12-27 01:27:19,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 01:27:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2019-12-27 01:27:19,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 884. [2019-12-27 01:27:19,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2019-12-27 01:27:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1865 transitions. [2019-12-27 01:27:19,509 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1865 transitions. Word has length 50 [2019-12-27 01:27:19,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:19,510 INFO L462 AbstractCegarLoop]: Abstraction has 884 states and 1865 transitions. [2019-12-27 01:27:19,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1865 transitions. [2019-12-27 01:27:19,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 01:27:19,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:19,513 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] [2019-12-27 01:27:19,513 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:19,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:19,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1408508718, now seen corresponding path program 1 times [2019-12-27 01:27:19,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:19,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094368610] [2019-12-27 01:27:19,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:19,571 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 01:27:19,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094368610] [2019-12-27 01:27:19,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:19,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:27:19,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051296681] [2019-12-27 01:27:19,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:19,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:19,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:19,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:19,573 INFO L87 Difference]: Start difference. First operand 884 states and 1865 transitions. Second operand 3 states. [2019-12-27 01:27:19,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:19,586 INFO L93 Difference]: Finished difference Result 883 states and 1863 transitions. [2019-12-27 01:27:19,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:19,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 01:27:19,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:19,588 INFO L225 Difference]: With dead ends: 883 [2019-12-27 01:27:19,589 INFO L226 Difference]: Without dead ends: 883 [2019-12-27 01:27:19,589 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 01:27:19,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-12-27 01:27:19,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 789. [2019-12-27 01:27:19,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-12-27 01:27:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1685 transitions. [2019-12-27 01:27:19,603 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1685 transitions. Word has length 51 [2019-12-27 01:27:19,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:19,604 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1685 transitions. [2019-12-27 01:27:19,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:19,604 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1685 transitions. [2019-12-27 01:27:19,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 01:27:19,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:19,606 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 01:27:19,606 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:19,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:19,607 INFO L82 PathProgramCache]: Analyzing trace with hash 355104308, now seen corresponding path program 1 times [2019-12-27 01:27:19,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:19,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637615772] [2019-12-27 01:27:19,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:27:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:27:19,746 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:27:19,747 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:27:19,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_418) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t307~0.base_27| 4) |v_#length_17|) (= v_~y$r_buff0_thd0~0_150 0) (= v_~y$r_buff1_thd1~0_136 0) (= 0 v_~y$w_buff0~0_517) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_265) (= v_~weak$$choice2~0_161 0) (= |v_ULTIMATE.start_main_~#t307~0.offset_19| 0) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t307~0.base_27|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t307~0.base_27|)) (= (store .cse0 |v_ULTIMATE.start_main_~#t307~0.base_27| 1) |v_#valid_61|) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t307~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t307~0.base_27|) |v_ULTIMATE.start_main_~#t307~0.offset_19| 0)) |v_#memory_int_11|) (= v_~x~0_99 0) (= v_~y~0_150 0) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, ULTIMATE.start_main_~#t308~0.offset=|v_ULTIMATE.start_main_~#t308~0.offset_20|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ULTIMATE.start_main_~#t307~0.base=|v_ULTIMATE.start_main_~#t307~0.base_27|, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_~#t308~0.base=|v_ULTIMATE.start_main_~#t308~0.base_28|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ULTIMATE.start_main_~#t307~0.offset=|v_ULTIMATE.start_main_~#t307~0.offset_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t308~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ULTIMATE.start_main_~#t307~0.base, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t308~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t307~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 01:27:19,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= |v_ULTIMATE.start_main_~#t308~0.offset_9| 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t308~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t308~0.base_10|) |v_ULTIMATE.start_main_~#t308~0.offset_9| 1))) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t308~0.base_10| 1)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t308~0.base_10| 4) |v_#length_9|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t308~0.base_10|) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t308~0.base_10|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t308~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t308~0.base=|v_ULTIMATE.start_main_~#t308~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#t308~0.offset=|v_ULTIMATE.start_main_~#t308~0.offset_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t308~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t308~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 01:27:19,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~y$r_buff1_thd0~0_Out855528678 ~y$r_buff0_thd0~0_In855528678) (= ~y$r_buff0_thd1~0_In855528678 ~y$r_buff1_thd1~0_Out855528678) (= 1 ~y$r_buff0_thd1~0_Out855528678) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In855528678 0)) (= ~x~0_In855528678 ~__unbuffered_p0_EAX~0_Out855528678) (= ~y$r_buff0_thd2~0_In855528678 ~y$r_buff1_thd2~0_Out855528678)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In855528678, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In855528678, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In855528678, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In855528678, ~x~0=~x~0_In855528678} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out855528678, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out855528678, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out855528678, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In855528678, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out855528678, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In855528678, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In855528678, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out855528678, ~x~0=~x~0_In855528678} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 01:27:19,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1729852578 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1729852578 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1729852578| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1729852578| ~y$w_buff0_used~0_In1729852578) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1729852578, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1729852578} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1729852578|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1729852578, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1729852578} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 01:27:19,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In831481701 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In831481701 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In831481701 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In831481701 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In831481701 |P0Thread1of1ForFork0_#t~ite6_Out831481701|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out831481701|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In831481701, ~y$w_buff0_used~0=~y$w_buff0_used~0_In831481701, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In831481701, ~y$w_buff1_used~0=~y$w_buff1_used~0_In831481701} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out831481701|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In831481701, ~y$w_buff0_used~0=~y$w_buff0_used~0_In831481701, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In831481701, ~y$w_buff1_used~0=~y$w_buff1_used~0_In831481701} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 01:27:19,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In93276638 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In93276638 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out93276638 ~y$r_buff0_thd1~0_In93276638) (or .cse0 .cse1)) (and (not .cse0) (= ~y$r_buff0_thd1~0_Out93276638 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In93276638, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In93276638} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In93276638, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out93276638|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out93276638} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:27:19,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In1447285907 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1447285907 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1447285907 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1447285907 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In1447285907 |P0Thread1of1ForFork0_#t~ite8_Out1447285907|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1447285907|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1447285907, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1447285907, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1447285907, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1447285907} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1447285907, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1447285907, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1447285907|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1447285907, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1447285907} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 01:27:19,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:27:19,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2143955866 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In-2143955866| |P1Thread1of1ForFork1_#t~ite17_Out-2143955866|) (= ~y$w_buff1~0_In-2143955866 |P1Thread1of1ForFork1_#t~ite18_Out-2143955866|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2143955866 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-2143955866 256) 0) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In-2143955866 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-2143955866 256)))) (= |P1Thread1of1ForFork1_#t~ite17_Out-2143955866| |P1Thread1of1ForFork1_#t~ite18_Out-2143955866|) (= |P1Thread1of1ForFork1_#t~ite17_Out-2143955866| ~y$w_buff1~0_In-2143955866) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2143955866, ~y$w_buff1~0=~y$w_buff1~0_In-2143955866, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2143955866, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2143955866, ~weak$$choice2~0=~weak$$choice2~0_In-2143955866, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-2143955866|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2143955866} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2143955866, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-2143955866|, ~y$w_buff1~0=~y$w_buff1~0_In-2143955866, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2143955866, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2143955866, ~weak$$choice2~0=~weak$$choice2~0_In-2143955866, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-2143955866|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2143955866} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 01:27:19,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-565280119 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-565280119| |P1Thread1of1ForFork1_#t~ite20_Out-565280119|) (= ~y$w_buff0_used~0_In-565280119 |P1Thread1of1ForFork1_#t~ite20_Out-565280119|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-565280119 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-565280119 256)) .cse0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-565280119 256)) .cse0) (= (mod ~y$w_buff0_used~0_In-565280119 256) 0))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite20_In-565280119| |P1Thread1of1ForFork1_#t~ite20_Out-565280119|) (= |P1Thread1of1ForFork1_#t~ite21_Out-565280119| ~y$w_buff0_used~0_In-565280119) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-565280119, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-565280119, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-565280119|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-565280119, ~weak$$choice2~0=~weak$$choice2~0_In-565280119, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-565280119} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-565280119, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-565280119, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-565280119|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-565280119, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-565280119|, ~weak$$choice2~0=~weak$$choice2~0_In-565280119, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-565280119} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 01:27:19,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In179582047 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In179582047 256))) (.cse4 (= (mod ~y$w_buff1_used~0_In179582047 256) 0)) (.cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out179582047| |P1Thread1of1ForFork1_#t~ite24_Out179582047|)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In179582047 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In179582047 256) 0))) (or (and (or (and (= ~y$w_buff1_used~0_In179582047 |P1Thread1of1ForFork1_#t~ite24_Out179582047|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_Out179582047| |P1Thread1of1ForFork1_#t~ite23_In179582047|)) (and (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2)) .cse0 .cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out179582047| ~y$w_buff1_used~0_In179582047))) (= |P1Thread1of1ForFork1_#t~ite22_In179582047| |P1Thread1of1ForFork1_#t~ite22_Out179582047|)) (let ((.cse6 (not .cse2))) (and (= |P1Thread1of1ForFork1_#t~ite22_Out179582047| 0) (= |P1Thread1of1ForFork1_#t~ite23_Out179582047| |P1Thread1of1ForFork1_#t~ite22_Out179582047|) .cse0 (or .cse6 (not .cse1)) (or .cse6 (not .cse4)) .cse5 (not .cse3))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In179582047, ~y$w_buff0_used~0=~y$w_buff0_used~0_In179582047, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In179582047, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In179582047|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In179582047|, ~weak$$choice2~0=~weak$$choice2~0_In179582047, ~y$w_buff1_used~0=~y$w_buff1_used~0_In179582047} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In179582047, ~y$w_buff0_used~0=~y$w_buff0_used~0_In179582047, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In179582047, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out179582047|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out179582047|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out179582047|, ~weak$$choice2~0=~weak$$choice2~0_In179582047, ~y$w_buff1_used~0=~y$w_buff1_used~0_In179582047} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 01:27:19,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_25|) (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_25|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_22|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_24|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_20|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_35|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_28|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 01:27:19,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-943862196 256)))) (or (let ((.cse0 (not (= 0 (mod ~y$r_buff0_thd2~0_In-943862196 256))))) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-943862196| |P1Thread1of1ForFork1_#t~ite28_Out-943862196|) (or (not (= (mod ~y$w_buff1_used~0_In-943862196 256) 0)) .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-943862196|) (= |P1Thread1of1ForFork1_#t~ite29_Out-943862196| |P1Thread1of1ForFork1_#t~ite30_Out-943862196|) (not (= (mod ~y$w_buff0_used~0_In-943862196 256) 0)) (or (not (= 0 (mod ~y$r_buff1_thd2~0_In-943862196 256))) .cse0) .cse1)) (and (= ~y$r_buff1_thd2~0_In-943862196 |P1Thread1of1ForFork1_#t~ite30_Out-943862196|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In-943862196| |P1Thread1of1ForFork1_#t~ite29_Out-943862196|) (= |P1Thread1of1ForFork1_#t~ite28_In-943862196| |P1Thread1of1ForFork1_#t~ite28_Out-943862196|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-943862196, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-943862196|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-943862196, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-943862196, ~weak$$choice2~0=~weak$$choice2~0_In-943862196, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-943862196|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-943862196} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-943862196, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-943862196|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-943862196|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-943862196, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-943862196, ~weak$$choice2~0=~weak$$choice2~0_In-943862196, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-943862196|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-943862196} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 01:27:19,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 01:27:19,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-687881970 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-687881970 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out-687881970| |P1Thread1of1ForFork1_#t~ite33_Out-687881970|))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out-687881970| ~y~0_In-687881970) (or .cse1 .cse2)) (and (not .cse1) (not .cse2) .cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out-687881970| ~y$w_buff1~0_In-687881970)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-687881970, ~y$w_buff1~0=~y$w_buff1~0_In-687881970, ~y~0=~y~0_In-687881970, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-687881970} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-687881970, ~y$w_buff1~0=~y$w_buff1~0_In-687881970, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-687881970|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-687881970|, ~y~0=~y~0_In-687881970, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-687881970} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 01:27:19,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1643471460 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1643471460 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1643471460|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1643471460 |P1Thread1of1ForFork1_#t~ite34_Out-1643471460|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1643471460, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1643471460} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1643471460, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1643471460, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1643471460|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 01:27:19,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1437709424 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1437709424 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1437709424 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1437709424 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-1437709424| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out-1437709424| ~y$w_buff1_used~0_In-1437709424)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1437709424, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1437709424, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1437709424, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1437709424} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1437709424, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1437709424, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1437709424, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1437709424|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1437709424} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 01:27:19,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In595429096 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In595429096 256)))) (or (and (= ~y$r_buff0_thd2~0_In595429096 |P1Thread1of1ForFork1_#t~ite36_Out595429096|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out595429096| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In595429096, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In595429096} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In595429096, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In595429096, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out595429096|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 01:27:19,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In816929958 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In816929958 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In816929958 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In816929958 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out816929958|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In816929958 |P1Thread1of1ForFork1_#t~ite37_Out816929958|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In816929958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In816929958, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In816929958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In816929958} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In816929958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In816929958, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In816929958, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out816929958|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In816929958} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 01:27:19,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_34|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_33|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 01:27:19,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (= 2 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 01:27:19,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1641679522 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1641679522 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1641679522| ~y~0_In1641679522) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1641679522| ~y$w_buff1~0_In1641679522)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1641679522, ~y~0=~y~0_In1641679522, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1641679522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1641679522} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1641679522|, ~y$w_buff1~0=~y$w_buff1~0_In1641679522, ~y~0=~y~0_In1641679522, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1641679522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1641679522} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 01:27:19,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 01:27:19,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1782993610 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1782993610 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out1782993610|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1782993610 |ULTIMATE.start_main_#t~ite42_Out1782993610|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1782993610, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1782993610} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1782993610, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1782993610, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1782993610|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 01:27:19,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1586057590 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1586057590 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1586057590 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1586057590 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out-1586057590| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out-1586057590| ~y$w_buff1_used~0_In-1586057590) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1586057590, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1586057590, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1586057590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1586057590} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1586057590, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1586057590, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1586057590|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1586057590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1586057590} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 01:27:19,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1762214237 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1762214237 256)))) (or (and (= ~y$r_buff0_thd0~0_In1762214237 |ULTIMATE.start_main_#t~ite44_Out1762214237|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1762214237| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1762214237, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1762214237} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1762214237, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1762214237, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1762214237|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 01:27:19,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-835799024 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-835799024 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-835799024 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-835799024 256) 0))) (or (and (= ~y$r_buff1_thd0~0_In-835799024 |ULTIMATE.start_main_#t~ite45_Out-835799024|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-835799024|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-835799024, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-835799024, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-835799024, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-835799024} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-835799024, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-835799024, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-835799024, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-835799024|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-835799024} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 01:27:19,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_28 0) (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:27:19,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:27:19 BasicIcfg [2019-12-27 01:27:19,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:27:19,888 INFO L168 Benchmark]: Toolchain (without parser) took 13496.82 ms. Allocated memory was 143.1 MB in the beginning and 405.8 MB in the end (delta: 262.7 MB). Free memory was 98.2 MB in the beginning and 136.3 MB in the end (delta: -38.1 MB). Peak memory consumption was 224.5 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:19,889 INFO L168 Benchmark]: CDTParser took 0.85 ms. Allocated memory is still 143.1 MB. Free memory was 118.2 MB in the beginning and 118.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 01:27:19,890 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.92 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 98.0 MB in the beginning and 153.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:19,891 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.51 ms. Allocated memory is still 200.8 MB. Free memory was 153.8 MB in the beginning and 150.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:19,891 INFO L168 Benchmark]: Boogie Preprocessor took 69.12 ms. Allocated memory is still 200.8 MB. Free memory was 150.9 MB in the beginning and 148.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:19,892 INFO L168 Benchmark]: RCFGBuilder took 815.89 ms. Allocated memory is still 200.8 MB. Free memory was 148.9 MB in the beginning and 104.4 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:19,893 INFO L168 Benchmark]: TraceAbstraction took 11749.44 ms. Allocated memory was 200.8 MB in the beginning and 405.8 MB in the end (delta: 205.0 MB). Free memory was 104.4 MB in the beginning and 136.3 MB in the end (delta: -31.9 MB). Peak memory consumption was 173.1 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:19,897 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.85 ms. Allocated memory is still 143.1 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 787.92 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 98.0 MB in the beginning and 153.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.51 ms. Allocated memory is still 200.8 MB. Free memory was 153.8 MB in the beginning and 150.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.12 ms. Allocated memory is still 200.8 MB. Free memory was 150.9 MB in the beginning and 148.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 815.89 ms. Allocated memory is still 200.8 MB. Free memory was 148.9 MB in the beginning and 104.4 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11749.44 ms. Allocated memory was 200.8 MB in the beginning and 405.8 MB in the end (delta: 205.0 MB). Free memory was 104.4 MB in the beginning and 136.3 MB in the end (delta: -31.9 MB). Peak memory consumption was 173.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 148 ProgramPointsBefore, 75 ProgramPointsAfterwards, 182 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 4966 VarBasedMoverChecksPositive, 278 VarBasedMoverChecksNegative, 167 SemBasedMoverChecksPositive, 218 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 77720 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t307, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t308, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1452 SDtfs, 1228 SDslu, 2594 SDs, 0 SdLazy, 1621 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8912occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 1783 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 349 ConstructedInterpolants, 0 QuantifiedInterpolants, 40981 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...