/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:18:39,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:18:39,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:18:39,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:18:39,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:18:39,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:18:39,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:18:39,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:18:39,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:18:39,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:18:39,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:18:39,193 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:18:39,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:18:39,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:18:39,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:18:39,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:18:39,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:18:39,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:18:39,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:18:39,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:18:39,204 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:18:39,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:18:39,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:18:39,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:18:39,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:18:39,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:18:39,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:18:39,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:18:39,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:18:39,212 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:18:39,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:18:39,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:18:39,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:18:39,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:18:39,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:18:39,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:18:39,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:18:39,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:18:39,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:18:39,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:18:39,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:18:39,224 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-MCR.epf [2019-12-27 16:18:39,239 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:18:39,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:18:39,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:18:39,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:18:39,241 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:18:39,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:18:39,241 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:18:39,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:18:39,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:18:39,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:18:39,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:18:39,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:18:39,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:18:39,243 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:18:39,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:18:39,243 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:18:39,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:18:39,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:18:39,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:18:39,244 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:18:39,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:18:39,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:18:39,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:18:39,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:18:39,245 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:18:39,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:18:39,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:18:39,245 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:18:39,246 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:18:39,246 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:18:39,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:18:39,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:18:39,550 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:18:39,555 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:18:39,556 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:18:39,557 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:18:39,558 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i [2019-12-27 16:18:39,625 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf44421a/b76aae65994d4f5f95725a6d5793c914/FLAG6accff434 [2019-12-27 16:18:40,174 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:18:40,175 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i [2019-12-27 16:18:40,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf44421a/b76aae65994d4f5f95725a6d5793c914/FLAG6accff434 [2019-12-27 16:18:40,450 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf44421a/b76aae65994d4f5f95725a6d5793c914 [2019-12-27 16:18:40,458 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:18:40,460 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:18:40,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:18:40,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:18:40,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:18:40,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:18:40" (1/1) ... [2019-12-27 16:18:40,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc96705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:40, skipping insertion in model container [2019-12-27 16:18:40,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:18:40" (1/1) ... [2019-12-27 16:18:40,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:18:40,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:18:41,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:18:41,132 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:18:41,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:18:41,311 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:18:41,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:41 WrapperNode [2019-12-27 16:18:41,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:18:41,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:18:41,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:18:41,313 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:18:41,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:41" (1/1) ... [2019-12-27 16:18:41,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:41" (1/1) ... [2019-12-27 16:18:41,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:18:41,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:18:41,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:18:41,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:18:41,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:41" (1/1) ... [2019-12-27 16:18:41,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:41" (1/1) ... [2019-12-27 16:18:41,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:41" (1/1) ... [2019-12-27 16:18:41,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:41" (1/1) ... [2019-12-27 16:18:41,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:41" (1/1) ... [2019-12-27 16:18:41,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:41" (1/1) ... [2019-12-27 16:18:41,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:41" (1/1) ... [2019-12-27 16:18:41,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:18:41,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:18:41,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:18:41,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:18:41,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:41" (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 16:18:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:18:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:18:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:18:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:18:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:18:41,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:18:41,499 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:18:41,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:18:41,499 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:18:41,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:18:41,499 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 16:18:41,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 16:18:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:18:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:18:41,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:18:41,503 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 16:18:42,358 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:18:42,358 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:18:42,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:18:42 BoogieIcfgContainer [2019-12-27 16:18:42,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:18:42,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:18:42,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:18:42,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:18:42,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:18:40" (1/3) ... [2019-12-27 16:18:42,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6f4c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:18:42, skipping insertion in model container [2019-12-27 16:18:42,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:41" (2/3) ... [2019-12-27 16:18:42,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6f4c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:18:42, skipping insertion in model container [2019-12-27 16:18:42,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:18:42" (3/3) ... [2019-12-27 16:18:42,375 INFO L109 eAbstractionObserver]: Analyzing ICFG mix023_power.opt.i [2019-12-27 16:18:42,387 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:18:42,388 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:18:42,400 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:18:42,402 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:18:42,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,458 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,460 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,463 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,463 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,519 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,523 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,523 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,527 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,527 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,533 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,533 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,533 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,534 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,534 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,534 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,534 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,534 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,534 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,535 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,535 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,535 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,535 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,535 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,536 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,536 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,536 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,536 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,536 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,537 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,537 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,537 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,537 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,537 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,538 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,538 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,538 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,538 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,538 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,538 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,543 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,543 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,544 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,546 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,546 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,546 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,546 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,546 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,547 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,547 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,550 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,551 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,554 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,557 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,560 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,561 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,561 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:42,578 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 16:18:42,599 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:18:42,599 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:18:42,599 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:18:42,599 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:18:42,599 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:18:42,599 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:18:42,599 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:18:42,600 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:18:42,618 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-27 16:18:42,620 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 16:18:42,742 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 16:18:42,742 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:18:42,759 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 16:18:42,785 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 16:18:42,864 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 16:18:42,865 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:18:42,876 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 16:18:42,900 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-27 16:18:42,901 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:18:48,583 WARN L192 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 16:18:48,719 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 16:18:48,870 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66461 [2019-12-27 16:18:48,870 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-27 16:18:48,874 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 95 transitions [2019-12-27 16:19:22,805 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160898 states. [2019-12-27 16:19:22,807 INFO L276 IsEmpty]: Start isEmpty. Operand 160898 states. [2019-12-27 16:19:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 16:19:22,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:19:22,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:19:22,814 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:19:22,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:19:22,819 INFO L82 PathProgramCache]: Analyzing trace with hash 406431864, now seen corresponding path program 1 times [2019-12-27 16:19:22,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:19:22,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787370199] [2019-12-27 16:19:22,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:19:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:19:23,165 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 16:19:23,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787370199] [2019-12-27 16:19:23,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:19:23,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:19:23,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1374864590] [2019-12-27 16:19:23,168 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:19:23,172 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:19:23,185 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 16:19:23,186 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:19:23,190 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:19:23,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:19:23,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:19:23,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:19:23,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:19:23,207 INFO L87 Difference]: Start difference. First operand 160898 states. Second operand 3 states. [2019-12-27 16:19:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:19:28,519 INFO L93 Difference]: Finished difference Result 158998 states and 767616 transitions. [2019-12-27 16:19:28,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:19:28,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 16:19:28,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:19:29,656 INFO L225 Difference]: With dead ends: 158998 [2019-12-27 16:19:29,656 INFO L226 Difference]: Without dead ends: 149254 [2019-12-27 16:19:29,659 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 16:19:35,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149254 states. [2019-12-27 16:19:41,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149254 to 149254. [2019-12-27 16:19:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149254 states. [2019-12-27 16:19:43,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149254 states to 149254 states and 719596 transitions. [2019-12-27 16:19:43,404 INFO L78 Accepts]: Start accepts. Automaton has 149254 states and 719596 transitions. Word has length 7 [2019-12-27 16:19:43,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:19:43,405 INFO L462 AbstractCegarLoop]: Abstraction has 149254 states and 719596 transitions. [2019-12-27 16:19:43,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:19:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 149254 states and 719596 transitions. [2019-12-27 16:19:43,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 16:19:43,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:19:43,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:19:43,421 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:19:43,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:19:43,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1843730986, now seen corresponding path program 1 times [2019-12-27 16:19:43,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:19:43,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917729711] [2019-12-27 16:19:43,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:19:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:19:43,492 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 16:19:43,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917729711] [2019-12-27 16:19:43,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:19:43,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:19:43,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [244294223] [2019-12-27 16:19:43,493 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:19:43,495 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:19:43,502 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 16:19:43,502 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:19:43,503 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:19:43,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:19:43,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:19:43,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:19:43,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:19:43,506 INFO L87 Difference]: Start difference. First operand 149254 states and 719596 transitions. Second operand 3 states. [2019-12-27 16:19:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:19:44,222 INFO L93 Difference]: Finished difference Result 94546 states and 411602 transitions. [2019-12-27 16:19:44,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:19:44,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 16:19:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:19:50,729 INFO L225 Difference]: With dead ends: 94546 [2019-12-27 16:19:50,730 INFO L226 Difference]: Without dead ends: 94546 [2019-12-27 16:19:50,730 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 16:19:53,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94546 states. [2019-12-27 16:19:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94546 to 94546. [2019-12-27 16:19:54,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94546 states. [2019-12-27 16:19:55,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94546 states to 94546 states and 411602 transitions. [2019-12-27 16:19:55,272 INFO L78 Accepts]: Start accepts. Automaton has 94546 states and 411602 transitions. Word has length 15 [2019-12-27 16:19:55,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:19:55,272 INFO L462 AbstractCegarLoop]: Abstraction has 94546 states and 411602 transitions. [2019-12-27 16:19:55,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:19:55,272 INFO L276 IsEmpty]: Start isEmpty. Operand 94546 states and 411602 transitions. [2019-12-27 16:19:55,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 16:19:55,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:19:55,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:19:55,275 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:19:55,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:19:55,276 INFO L82 PathProgramCache]: Analyzing trace with hash -425966823, now seen corresponding path program 1 times [2019-12-27 16:19:55,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:19:55,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250958214] [2019-12-27 16:19:55,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:19:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:19:55,362 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 16:19:55,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250958214] [2019-12-27 16:19:55,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:19:55,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:19:55,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [134096651] [2019-12-27 16:19:55,364 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:19:55,367 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:19:55,369 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 16:19:55,369 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:19:55,369 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:19:55,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:19:55,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:19:55,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:19:55,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:19:55,370 INFO L87 Difference]: Start difference. First operand 94546 states and 411602 transitions. Second operand 4 states. [2019-12-27 16:19:56,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:19:56,382 INFO L93 Difference]: Finished difference Result 144639 states and 604914 transitions. [2019-12-27 16:19:56,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:19:56,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 16:19:56,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:19:58,251 INFO L225 Difference]: With dead ends: 144639 [2019-12-27 16:19:58,251 INFO L226 Difference]: Without dead ends: 144527 [2019-12-27 16:19:58,252 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 16:20:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144527 states. [2019-12-27 16:20:09,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144527 to 133390. [2019-12-27 16:20:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133390 states. [2019-12-27 16:20:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133390 states to 133390 states and 563187 transitions. [2019-12-27 16:20:09,530 INFO L78 Accepts]: Start accepts. Automaton has 133390 states and 563187 transitions. Word has length 15 [2019-12-27 16:20:09,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:20:09,530 INFO L462 AbstractCegarLoop]: Abstraction has 133390 states and 563187 transitions. [2019-12-27 16:20:09,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:20:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 133390 states and 563187 transitions. [2019-12-27 16:20:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:20:09,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:20:09,534 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:20:09,534 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:20:09,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:20:09,534 INFO L82 PathProgramCache]: Analyzing trace with hash -35287386, now seen corresponding path program 1 times [2019-12-27 16:20:09,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:20:09,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195845279] [2019-12-27 16:20:09,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:20:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:20:09,629 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 16:20:09,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195845279] [2019-12-27 16:20:09,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:20:09,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:20:09,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1821061699] [2019-12-27 16:20:09,630 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:20:09,631 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:20:09,633 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 16:20:09,634 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:20:09,670 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:20:09,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:20:09,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:20:09,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:20:09,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:20:09,671 INFO L87 Difference]: Start difference. First operand 133390 states and 563187 transitions. Second operand 5 states. [2019-12-27 16:20:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:20:10,966 INFO L93 Difference]: Finished difference Result 37161 states and 133398 transitions. [2019-12-27 16:20:10,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:20:10,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 16:20:10,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:20:11,038 INFO L225 Difference]: With dead ends: 37161 [2019-12-27 16:20:11,038 INFO L226 Difference]: Without dead ends: 37161 [2019-12-27 16:20:11,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:20:11,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37161 states. [2019-12-27 16:20:11,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37161 to 37161. [2019-12-27 16:20:11,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37161 states. [2019-12-27 16:20:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37161 states to 37161 states and 133398 transitions. [2019-12-27 16:20:11,758 INFO L78 Accepts]: Start accepts. Automaton has 37161 states and 133398 transitions. Word has length 16 [2019-12-27 16:20:11,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:20:11,758 INFO L462 AbstractCegarLoop]: Abstraction has 37161 states and 133398 transitions. [2019-12-27 16:20:11,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:20:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 37161 states and 133398 transitions. [2019-12-27 16:20:11,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:20:11,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:20:11,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:20:11,762 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:20:11,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:20:11,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1700714978, now seen corresponding path program 1 times [2019-12-27 16:20:11,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:20:11,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039637190] [2019-12-27 16:20:11,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:20:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:20:11,835 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 16:20:11,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039637190] [2019-12-27 16:20:11,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:20:11,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:20:11,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1370763525] [2019-12-27 16:20:11,836 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:20:11,838 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:20:11,842 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 16:20:11,843 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:20:11,894 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:20:11,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:20:11,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:20:11,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:20:11,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:20:11,895 INFO L87 Difference]: Start difference. First operand 37161 states and 133398 transitions. Second operand 7 states. [2019-12-27 16:20:12,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:20:12,678 INFO L93 Difference]: Finished difference Result 54896 states and 192989 transitions. [2019-12-27 16:20:12,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:20:12,678 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-27 16:20:12,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:20:12,792 INFO L225 Difference]: With dead ends: 54896 [2019-12-27 16:20:12,793 INFO L226 Difference]: Without dead ends: 54878 [2019-12-27 16:20:12,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:20:13,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54878 states. [2019-12-27 16:20:14,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54878 to 43369. [2019-12-27 16:20:14,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43369 states. [2019-12-27 16:20:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43369 states to 43369 states and 154803 transitions. [2019-12-27 16:20:14,852 INFO L78 Accepts]: Start accepts. Automaton has 43369 states and 154803 transitions. Word has length 16 [2019-12-27 16:20:14,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:20:14,852 INFO L462 AbstractCegarLoop]: Abstraction has 43369 states and 154803 transitions. [2019-12-27 16:20:14,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:20:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 43369 states and 154803 transitions. [2019-12-27 16:20:14,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 16:20:14,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:20:14,870 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 16:20:14,871 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:20:14,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:20:14,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1135187325, now seen corresponding path program 1 times [2019-12-27 16:20:14,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:20:14,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246352922] [2019-12-27 16:20:14,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:20:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:20:14,959 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 16:20:14,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246352922] [2019-12-27 16:20:14,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:20:14,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:20:14,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [551026019] [2019-12-27 16:20:14,961 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:20:14,964 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:20:14,978 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 114 transitions. [2019-12-27 16:20:14,978 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:20:15,027 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:20:15,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:20:15,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:20:15,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:20:15,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:20:15,028 INFO L87 Difference]: Start difference. First operand 43369 states and 154803 transitions. Second operand 8 states. [2019-12-27 16:20:16,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:20:16,220 INFO L93 Difference]: Finished difference Result 65283 states and 226759 transitions. [2019-12-27 16:20:16,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:20:16,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-27 16:20:16,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:20:16,350 INFO L225 Difference]: With dead ends: 65283 [2019-12-27 16:20:16,350 INFO L226 Difference]: Without dead ends: 65253 [2019-12-27 16:20:16,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:20:19,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65253 states. [2019-12-27 16:20:20,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65253 to 43597. [2019-12-27 16:20:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43597 states. [2019-12-27 16:20:20,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43597 states to 43597 states and 154758 transitions. [2019-12-27 16:20:20,277 INFO L78 Accepts]: Start accepts. Automaton has 43597 states and 154758 transitions. Word has length 24 [2019-12-27 16:20:20,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:20:20,277 INFO L462 AbstractCegarLoop]: Abstraction has 43597 states and 154758 transitions. [2019-12-27 16:20:20,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:20:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 43597 states and 154758 transitions. [2019-12-27 16:20:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:20:20,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:20:20,300 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 16:20:20,300 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:20:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:20:20,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1458605799, now seen corresponding path program 1 times [2019-12-27 16:20:20,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:20:20,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277587228] [2019-12-27 16:20:20,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:20:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:20:20,408 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 16:20:20,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277587228] [2019-12-27 16:20:20,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:20:20,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:20:20,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [754834139] [2019-12-27 16:20:20,410 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:20:20,414 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:20:20,422 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 40 transitions. [2019-12-27 16:20:20,423 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:20:20,441 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:20:20,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:20:20,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:20:20,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:20:20,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:20:20,443 INFO L87 Difference]: Start difference. First operand 43597 states and 154758 transitions. Second operand 6 states. [2019-12-27 16:20:20,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:20:20,575 INFO L93 Difference]: Finished difference Result 23301 states and 83755 transitions. [2019-12-27 16:20:20,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:20:20,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 16:20:20,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:20:20,619 INFO L225 Difference]: With dead ends: 23301 [2019-12-27 16:20:20,619 INFO L226 Difference]: Without dead ends: 23301 [2019-12-27 16:20:20,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:20:20,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23301 states. [2019-12-27 16:20:21,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23301 to 22997. [2019-12-27 16:20:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22997 states. [2019-12-27 16:20:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22997 states to 22997 states and 82723 transitions. [2019-12-27 16:20:21,445 INFO L78 Accepts]: Start accepts. Automaton has 22997 states and 82723 transitions. Word has length 28 [2019-12-27 16:20:21,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:20:21,445 INFO L462 AbstractCegarLoop]: Abstraction has 22997 states and 82723 transitions. [2019-12-27 16:20:21,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:20:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 22997 states and 82723 transitions. [2019-12-27 16:20:21,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 16:20:21,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:20:21,486 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] [2019-12-27 16:20:21,486 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:20:21,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:20:21,486 INFO L82 PathProgramCache]: Analyzing trace with hash 289915716, now seen corresponding path program 1 times [2019-12-27 16:20:21,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:20:21,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721055316] [2019-12-27 16:20:21,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:20:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:20:21,599 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 16:20:21,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721055316] [2019-12-27 16:20:21,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:20:21,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:20:21,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [70594802] [2019-12-27 16:20:21,600 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:20:21,610 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:20:21,666 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 241 transitions. [2019-12-27 16:20:21,666 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:20:21,678 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:20:21,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:20:21,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:20:21,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:20:21,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:20:21,679 INFO L87 Difference]: Start difference. First operand 22997 states and 82723 transitions. Second operand 4 states. [2019-12-27 16:20:21,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:20:21,827 INFO L93 Difference]: Finished difference Result 34696 states and 119073 transitions. [2019-12-27 16:20:21,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:20:21,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 16:20:21,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:20:21,871 INFO L225 Difference]: With dead ends: 34696 [2019-12-27 16:20:21,871 INFO L226 Difference]: Without dead ends: 23444 [2019-12-27 16:20:21,872 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 16:20:21,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23444 states. [2019-12-27 16:20:22,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23444 to 23042. [2019-12-27 16:20:22,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23042 states. [2019-12-27 16:20:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23042 states to 23042 states and 72359 transitions. [2019-12-27 16:20:22,285 INFO L78 Accepts]: Start accepts. Automaton has 23042 states and 72359 transitions. Word has length 42 [2019-12-27 16:20:22,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:20:22,285 INFO L462 AbstractCegarLoop]: Abstraction has 23042 states and 72359 transitions. [2019-12-27 16:20:22,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:20:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 23042 states and 72359 transitions. [2019-12-27 16:20:22,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 16:20:22,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:20:22,324 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] [2019-12-27 16:20:22,324 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:20:22,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:20:22,324 INFO L82 PathProgramCache]: Analyzing trace with hash 9371836, now seen corresponding path program 1 times [2019-12-27 16:20:22,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:20:22,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598998935] [2019-12-27 16:20:22,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:20:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:20:22,406 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 16:20:22,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598998935] [2019-12-27 16:20:22,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:20:22,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:20:22,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1707174725] [2019-12-27 16:20:22,408 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:20:22,417 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:20:22,507 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 413 transitions. [2019-12-27 16:20:22,507 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:20:22,550 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:20:22,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:20:22,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:20:22,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:20:22,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:20:22,552 INFO L87 Difference]: Start difference. First operand 23042 states and 72359 transitions. Second operand 8 states. [2019-12-27 16:20:22,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:20:22,703 INFO L93 Difference]: Finished difference Result 21758 states and 69087 transitions. [2019-12-27 16:20:22,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:20:22,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-12-27 16:20:22,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:20:22,723 INFO L225 Difference]: With dead ends: 21758 [2019-12-27 16:20:22,723 INFO L226 Difference]: Without dead ends: 11194 [2019-12-27 16:20:22,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:20:22,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11194 states. [2019-12-27 16:20:22,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11194 to 10798. [2019-12-27 16:20:22,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10798 states. [2019-12-27 16:20:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10798 states to 10798 states and 34133 transitions. [2019-12-27 16:20:23,296 INFO L78 Accepts]: Start accepts. Automaton has 10798 states and 34133 transitions. Word has length 43 [2019-12-27 16:20:23,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:20:23,297 INFO L462 AbstractCegarLoop]: Abstraction has 10798 states and 34133 transitions. [2019-12-27 16:20:23,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:20:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 10798 states and 34133 transitions. [2019-12-27 16:20:23,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:20:23,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:20:23,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:20:23,310 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:20:23,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:20:23,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1454862528, now seen corresponding path program 1 times [2019-12-27 16:20:23,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:20:23,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825729943] [2019-12-27 16:20:23,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:20:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:20:23,375 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 16:20:23,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825729943] [2019-12-27 16:20:23,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:20:23,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:20:23,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [765362851] [2019-12-27 16:20:23,377 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:20:23,396 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:20:23,718 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 442 states and 887 transitions. [2019-12-27 16:20:23,718 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:20:23,735 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:20:23,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:20:23,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:20:23,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:20:23,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:20:23,736 INFO L87 Difference]: Start difference. First operand 10798 states and 34133 transitions. Second operand 3 states. [2019-12-27 16:20:23,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:20:23,836 INFO L93 Difference]: Finished difference Result 14554 states and 45133 transitions. [2019-12-27 16:20:23,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:20:23,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 16:20:23,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:20:23,856 INFO L225 Difference]: With dead ends: 14554 [2019-12-27 16:20:23,856 INFO L226 Difference]: Without dead ends: 14554 [2019-12-27 16:20:23,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 16:20:23,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14554 states. [2019-12-27 16:20:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14554 to 11851. [2019-12-27 16:20:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11851 states. [2019-12-27 16:20:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11851 states to 11851 states and 37349 transitions. [2019-12-27 16:20:24,046 INFO L78 Accepts]: Start accepts. Automaton has 11851 states and 37349 transitions. Word has length 57 [2019-12-27 16:20:24,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:20:24,047 INFO L462 AbstractCegarLoop]: Abstraction has 11851 states and 37349 transitions. [2019-12-27 16:20:24,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:20:24,047 INFO L276 IsEmpty]: Start isEmpty. Operand 11851 states and 37349 transitions. [2019-12-27 16:20:24,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:20:24,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:20:24,059 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:20:24,059 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:20:24,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:20:24,060 INFO L82 PathProgramCache]: Analyzing trace with hash -880753033, now seen corresponding path program 1 times [2019-12-27 16:20:24,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:20:24,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904740492] [2019-12-27 16:20:24,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:20:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:20:24,142 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 16:20:24,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904740492] [2019-12-27 16:20:24,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:20:24,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:20:24,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [938038443] [2019-12-27 16:20:24,143 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:20:24,161 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:20:24,693 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 442 states and 887 transitions. [2019-12-27 16:20:24,693 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:20:24,914 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 16:20:24,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:20:24,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:20:24,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:20:24,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:20:24,916 INFO L87 Difference]: Start difference. First operand 11851 states and 37349 transitions. Second operand 9 states. [2019-12-27 16:20:25,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:20:25,621 INFO L93 Difference]: Finished difference Result 34990 states and 111042 transitions. [2019-12-27 16:20:25,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:20:25,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 16:20:25,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:20:25,652 INFO L225 Difference]: With dead ends: 34990 [2019-12-27 16:20:25,652 INFO L226 Difference]: Without dead ends: 21200 [2019-12-27 16:20:25,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:20:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21200 states. [2019-12-27 16:20:25,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21200 to 16995. [2019-12-27 16:20:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16995 states. [2019-12-27 16:20:25,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16995 states to 16995 states and 54053 transitions. [2019-12-27 16:20:25,943 INFO L78 Accepts]: Start accepts. Automaton has 16995 states and 54053 transitions. Word has length 57 [2019-12-27 16:20:25,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:20:25,943 INFO L462 AbstractCegarLoop]: Abstraction has 16995 states and 54053 transitions. [2019-12-27 16:20:25,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:20:25,944 INFO L276 IsEmpty]: Start isEmpty. Operand 16995 states and 54053 transitions. [2019-12-27 16:20:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:20:25,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:20:25,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:20:25,964 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:20:25,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:20:25,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1310347391, now seen corresponding path program 2 times [2019-12-27 16:20:25,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:20:25,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819397634] [2019-12-27 16:20:25,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:20:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:20:26,067 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 16:20:26,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819397634] [2019-12-27 16:20:26,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:20:26,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:20:26,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1176479856] [2019-12-27 16:20:26,068 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:20:26,085 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:20:26,381 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 249 states and 450 transitions. [2019-12-27 16:20:26,381 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:20:26,443 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 16:20:26,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:20:26,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:20:26,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:20:26,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:20:26,445 INFO L87 Difference]: Start difference. First operand 16995 states and 54053 transitions. Second operand 7 states. [2019-12-27 16:20:26,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:20:26,838 INFO L93 Difference]: Finished difference Result 43936 states and 139274 transitions. [2019-12-27 16:20:26,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:20:26,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 16:20:26,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:20:26,889 INFO L225 Difference]: With dead ends: 43936 [2019-12-27 16:20:26,889 INFO L226 Difference]: Without dead ends: 33714 [2019-12-27 16:20:26,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:20:26,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33714 states. [2019-12-27 16:20:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33714 to 20868. [2019-12-27 16:20:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20868 states. [2019-12-27 16:20:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20868 states to 20868 states and 66818 transitions. [2019-12-27 16:20:27,314 INFO L78 Accepts]: Start accepts. Automaton has 20868 states and 66818 transitions. Word has length 57 [2019-12-27 16:20:27,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:20:27,314 INFO L462 AbstractCegarLoop]: Abstraction has 20868 states and 66818 transitions. [2019-12-27 16:20:27,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:20:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 20868 states and 66818 transitions. [2019-12-27 16:20:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:20:27,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:20:27,346 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:20:27,346 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:20:27,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:20:27,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1030628791, now seen corresponding path program 3 times [2019-12-27 16:20:27,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:20:27,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230322074] [2019-12-27 16:20:27,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:20:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:20:27,452 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 16:20:27,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230322074] [2019-12-27 16:20:27,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:20:27,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:20:27,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [70807422] [2019-12-27 16:20:27,453 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:20:27,492 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:20:28,048 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 305 states and 600 transitions. [2019-12-27 16:20:28,048 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:20:28,076 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:20:28,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:20:28,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:20:28,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:20:28,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:20:28,077 INFO L87 Difference]: Start difference. First operand 20868 states and 66818 transitions. Second operand 8 states. [2019-12-27 16:20:29,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:20:29,796 INFO L93 Difference]: Finished difference Result 65485 states and 205967 transitions. [2019-12-27 16:20:29,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 16:20:29,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-27 16:20:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:20:29,884 INFO L225 Difference]: With dead ends: 65485 [2019-12-27 16:20:29,885 INFO L226 Difference]: Without dead ends: 48366 [2019-12-27 16:20:29,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-12-27 16:20:30,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48366 states. [2019-12-27 16:20:30,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48366 to 26353. [2019-12-27 16:20:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26353 states. [2019-12-27 16:20:30,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26353 states to 26353 states and 84256 transitions. [2019-12-27 16:20:30,512 INFO L78 Accepts]: Start accepts. Automaton has 26353 states and 84256 transitions. Word has length 57 [2019-12-27 16:20:30,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:20:30,512 INFO L462 AbstractCegarLoop]: Abstraction has 26353 states and 84256 transitions. [2019-12-27 16:20:30,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:20:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand 26353 states and 84256 transitions. [2019-12-27 16:20:30,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:20:30,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:20:30,542 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:20:30,543 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:20:30,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:20:30,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1587000503, now seen corresponding path program 4 times [2019-12-27 16:20:30,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:20:30,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149710416] [2019-12-27 16:20:30,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:20:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:20:30,682 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 16:20:30,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149710416] [2019-12-27 16:20:30,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:20:30,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:20:30,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2051155396] [2019-12-27 16:20:30,683 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:20:30,700 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:20:31,265 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 330 states and 671 transitions. [2019-12-27 16:20:31,265 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:20:31,294 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:20:31,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:20:31,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:20:31,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:20:31,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:20:31,295 INFO L87 Difference]: Start difference. First operand 26353 states and 84256 transitions. Second operand 10 states. [2019-12-27 16:20:33,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:20:33,514 INFO L93 Difference]: Finished difference Result 89832 states and 277268 transitions. [2019-12-27 16:20:33,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 16:20:33,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-12-27 16:20:33,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:20:33,653 INFO L225 Difference]: With dead ends: 89832 [2019-12-27 16:20:33,653 INFO L226 Difference]: Without dead ends: 80642 [2019-12-27 16:20:33,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=541, Invalid=1715, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 16:20:33,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80642 states. [2019-12-27 16:20:34,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80642 to 31985. [2019-12-27 16:20:34,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31985 states. [2019-12-27 16:20:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31985 states to 31985 states and 102212 transitions. [2019-12-27 16:20:34,966 INFO L78 Accepts]: Start accepts. Automaton has 31985 states and 102212 transitions. Word has length 57 [2019-12-27 16:20:34,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:20:34,966 INFO L462 AbstractCegarLoop]: Abstraction has 31985 states and 102212 transitions. [2019-12-27 16:20:34,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:20:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 31985 states and 102212 transitions. [2019-12-27 16:20:35,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:20:35,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:20:35,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:20:35,002 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:20:35,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:20:35,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1355321517, now seen corresponding path program 5 times [2019-12-27 16:20:35,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:20:35,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299059144] [2019-12-27 16:20:35,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:20:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:20:35,090 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 16:20:35,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299059144] [2019-12-27 16:20:35,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:20:35,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:20:35,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [879934662] [2019-12-27 16:20:35,091 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:20:35,107 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:20:35,332 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 313 states and 577 transitions. [2019-12-27 16:20:35,332 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:20:35,344 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:20:35,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:20:35,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:20:35,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:20:35,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:20:35,346 INFO L87 Difference]: Start difference. First operand 31985 states and 102212 transitions. Second operand 4 states. [2019-12-27 16:20:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:20:35,638 INFO L93 Difference]: Finished difference Result 37470 states and 115861 transitions. [2019-12-27 16:20:35,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:20:35,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-27 16:20:35,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:20:35,692 INFO L225 Difference]: With dead ends: 37470 [2019-12-27 16:20:35,692 INFO L226 Difference]: Without dead ends: 37470 [2019-12-27 16:20:35,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:20:36,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37470 states. [2019-12-27 16:20:36,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37470 to 25856. [2019-12-27 16:20:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25856 states. [2019-12-27 16:20:36,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25856 states to 25856 states and 80624 transitions. [2019-12-27 16:20:36,352 INFO L78 Accepts]: Start accepts. Automaton has 25856 states and 80624 transitions. Word has length 57 [2019-12-27 16:20:36,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:20:36,353 INFO L462 AbstractCegarLoop]: Abstraction has 25856 states and 80624 transitions. [2019-12-27 16:20:36,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:20:36,353 INFO L276 IsEmpty]: Start isEmpty. Operand 25856 states and 80624 transitions. [2019-12-27 16:20:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 16:20:36,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:20:36,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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:20:36,381 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:20:36,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:20:36,382 INFO L82 PathProgramCache]: Analyzing trace with hash -454137528, now seen corresponding path program 1 times [2019-12-27 16:20:36,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:20:36,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988859173] [2019-12-27 16:20:36,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:20:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:20:36,457 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 16:20:36,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988859173] [2019-12-27 16:20:36,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:20:36,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:20:36,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1294037997] [2019-12-27 16:20:36,458 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:20:36,475 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:20:36,768 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 281 states and 543 transitions. [2019-12-27 16:20:36,768 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:20:36,769 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:20:36,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:20:36,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:20:36,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:20:36,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:20:36,770 INFO L87 Difference]: Start difference. First operand 25856 states and 80624 transitions. Second operand 3 states. [2019-12-27 16:20:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:20:36,932 INFO L93 Difference]: Finished difference Result 25856 states and 80622 transitions. [2019-12-27 16:20:36,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:20:36,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 16:20:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:20:37,005 INFO L225 Difference]: With dead ends: 25856 [2019-12-27 16:20:37,005 INFO L226 Difference]: Without dead ends: 25856 [2019-12-27 16:20:37,006 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 16:20:37,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25856 states. [2019-12-27 16:20:37,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25856 to 23550. [2019-12-27 16:20:37,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23550 states. [2019-12-27 16:20:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23550 states to 23550 states and 74232 transitions. [2019-12-27 16:20:37,931 INFO L78 Accepts]: Start accepts. Automaton has 23550 states and 74232 transitions. Word has length 58 [2019-12-27 16:20:37,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:20:37,932 INFO L462 AbstractCegarLoop]: Abstraction has 23550 states and 74232 transitions. [2019-12-27 16:20:37,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:20:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 23550 states and 74232 transitions. [2019-12-27 16:20:37,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 16:20:37,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:20:37,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:20:37,965 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:20:37,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:20:37,965 INFO L82 PathProgramCache]: Analyzing trace with hash -286713595, now seen corresponding path program 1 times [2019-12-27 16:20:37,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:20:37,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693163926] [2019-12-27 16:20:37,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:20:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:20:38,163 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 16:20:38,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693163926] [2019-12-27 16:20:38,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:20:38,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:20:38,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [900177490] [2019-12-27 16:20:38,165 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:20:38,183 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:20:38,523 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 282 states and 544 transitions. [2019-12-27 16:20:38,523 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:20:38,569 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:20:38,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:20:38,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:20:38,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:20:38,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:20:38,571 INFO L87 Difference]: Start difference. First operand 23550 states and 74232 transitions. Second operand 12 states. [2019-12-27 16:20:41,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:20:41,743 INFO L93 Difference]: Finished difference Result 48085 states and 150400 transitions. [2019-12-27 16:20:41,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 16:20:41,744 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-27 16:20:41,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:20:41,838 INFO L225 Difference]: With dead ends: 48085 [2019-12-27 16:20:41,838 INFO L226 Difference]: Without dead ends: 33873 [2019-12-27 16:20:41,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 16:20:42,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33873 states. [2019-12-27 16:20:42,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33873 to 24749. [2019-12-27 16:20:42,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24749 states. [2019-12-27 16:20:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24749 states to 24749 states and 77275 transitions. [2019-12-27 16:20:42,871 INFO L78 Accepts]: Start accepts. Automaton has 24749 states and 77275 transitions. Word has length 59 [2019-12-27 16:20:42,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:20:42,872 INFO L462 AbstractCegarLoop]: Abstraction has 24749 states and 77275 transitions. [2019-12-27 16:20:42,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:20:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 24749 states and 77275 transitions. [2019-12-27 16:20:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 16:20:42,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:20:42,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:20:42,902 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:20:42,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:20:42,902 INFO L82 PathProgramCache]: Analyzing trace with hash 490336035, now seen corresponding path program 2 times [2019-12-27 16:20:42,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:20:42,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364731078] [2019-12-27 16:20:42,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:20:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:20:43,531 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 16:20:43,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364731078] [2019-12-27 16:20:43,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:20:43,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 16:20:43,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [701689748] [2019-12-27 16:20:43,540 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:20:43,567 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:20:44,064 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 381 states and 804 transitions. [2019-12-27 16:20:44,064 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:20:44,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:20:44,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:20:44,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 16:20:44,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:20:44,838 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 16:20:44,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 16:20:44,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:20:44,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 16:20:44,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=911, Unknown=0, NotChecked=0, Total=992 [2019-12-27 16:20:44,840 INFO L87 Difference]: Start difference. First operand 24749 states and 77275 transitions. Second operand 32 states. [2019-12-27 16:20:44,983 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-12-27 16:20:47,274 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-12-27 16:21:10,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:21:10,270 INFO L93 Difference]: Finished difference Result 54302 states and 161713 transitions. [2019-12-27 16:21:10,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2019-12-27 16:21:10,270 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 59 [2019-12-27 16:21:10,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:21:10,339 INFO L225 Difference]: With dead ends: 54302 [2019-12-27 16:21:10,339 INFO L226 Difference]: Without dead ends: 47287 [2019-12-27 16:21:10,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19494 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=4220, Invalid=47992, Unknown=0, NotChecked=0, Total=52212 [2019-12-27 16:21:10,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47287 states. [2019-12-27 16:21:10,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47287 to 27046. [2019-12-27 16:21:10,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27046 states. [2019-12-27 16:21:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27046 states to 27046 states and 84395 transitions. [2019-12-27 16:21:11,020 INFO L78 Accepts]: Start accepts. Automaton has 27046 states and 84395 transitions. Word has length 59 [2019-12-27 16:21:11,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:21:11,020 INFO L462 AbstractCegarLoop]: Abstraction has 27046 states and 84395 transitions. [2019-12-27 16:21:11,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 16:21:11,020 INFO L276 IsEmpty]: Start isEmpty. Operand 27046 states and 84395 transitions. [2019-12-27 16:21:11,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 16:21:11,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:21:11,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:21:11,050 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:21:11,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:21:11,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1026660081, now seen corresponding path program 3 times [2019-12-27 16:21:11,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:21:11,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623256412] [2019-12-27 16:21:11,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:21:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:21:11,264 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 16:21:11,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623256412] [2019-12-27 16:21:11,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:21:11,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:21:11,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1857001279] [2019-12-27 16:21:11,265 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:21:11,411 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:21:11,663 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 247 states and 442 transitions. [2019-12-27 16:21:11,664 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:21:11,761 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 16:21:11,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:21:11,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:21:11,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:21:11,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:21:11,763 INFO L87 Difference]: Start difference. First operand 27046 states and 84395 transitions. Second operand 12 states. [2019-12-27 16:21:14,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:21:14,476 INFO L93 Difference]: Finished difference Result 44208 states and 136602 transitions. [2019-12-27 16:21:14,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 16:21:14,477 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-27 16:21:14,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:21:14,535 INFO L225 Difference]: With dead ends: 44208 [2019-12-27 16:21:14,535 INFO L226 Difference]: Without dead ends: 35903 [2019-12-27 16:21:14,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 16:21:14,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35903 states. [2019-12-27 16:21:15,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35903 to 25997. [2019-12-27 16:21:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25997 states. [2019-12-27 16:21:15,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25997 states to 25997 states and 81178 transitions. [2019-12-27 16:21:15,085 INFO L78 Accepts]: Start accepts. Automaton has 25997 states and 81178 transitions. Word has length 59 [2019-12-27 16:21:15,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:21:15,086 INFO L462 AbstractCegarLoop]: Abstraction has 25997 states and 81178 transitions. [2019-12-27 16:21:15,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:21:15,086 INFO L276 IsEmpty]: Start isEmpty. Operand 25997 states and 81178 transitions. [2019-12-27 16:21:15,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 16:21:15,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:21:15,123 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:21:15,123 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:21:15,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:21:15,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1218341339, now seen corresponding path program 4 times [2019-12-27 16:21:15,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:21:15,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674010123] [2019-12-27 16:21:15,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:21:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:21:15,821 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 16:21:15,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674010123] [2019-12-27 16:21:15,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:21:15,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 16:21:15,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1863954741] [2019-12-27 16:21:15,822 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:21:16,044 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:21:16,251 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 256 states and 449 transitions. [2019-12-27 16:21:16,252 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:21:16,758 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 16:21:16,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 16:21:16,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:21:16,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 16:21:16,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-12-27 16:21:16,759 INFO L87 Difference]: Start difference. First operand 25997 states and 81178 transitions. Second operand 27 states. [2019-12-27 16:21:23,190 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-12-27 16:21:33,484 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-27 16:21:49,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:21:49,658 INFO L93 Difference]: Finished difference Result 114922 states and 348399 transitions. [2019-12-27 16:21:49,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 294 states. [2019-12-27 16:21:49,659 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2019-12-27 16:21:49,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:21:49,817 INFO L225 Difference]: With dead ends: 114922 [2019-12-27 16:21:49,817 INFO L226 Difference]: Without dead ends: 106387 [2019-12-27 16:21:49,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39664 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=8514, Invalid=85428, Unknown=0, NotChecked=0, Total=93942 [2019-12-27 16:21:50,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106387 states. [2019-12-27 16:21:51,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106387 to 39007. [2019-12-27 16:21:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39007 states. [2019-12-27 16:21:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39007 states to 39007 states and 123815 transitions. [2019-12-27 16:21:51,354 INFO L78 Accepts]: Start accepts. Automaton has 39007 states and 123815 transitions. Word has length 59 [2019-12-27 16:21:51,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:21:51,354 INFO L462 AbstractCegarLoop]: Abstraction has 39007 states and 123815 transitions. [2019-12-27 16:21:51,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 16:21:51,354 INFO L276 IsEmpty]: Start isEmpty. Operand 39007 states and 123815 transitions. [2019-12-27 16:21:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 16:21:51,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:21:51,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:21:51,401 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:21:51,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:21:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1779176519, now seen corresponding path program 5 times [2019-12-27 16:21:51,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:21:51,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098332084] [2019-12-27 16:21:51,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:21:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:21:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:21:51,524 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:21:51,524 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:21:51,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] ULTIMATE.startENTRY-->L846: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_48 0) (= v_~x~0_72 0) (= v_~y$w_buff1_used~0_529 0) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff1_thd1~0_122 0) (= 0 v_~y$w_buff0~0_386) (= 0 v_~y$r_buff0_thd2~0_330) (= v_~__unbuffered_cnt~0_187 0) (= v_~main$tmp_guard1~0_42 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~y~0_163 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd3~0_189) (= 0 v_~__unbuffered_p3_EBX~0_48) (= v_~y$w_buff1~0_278 0) (= 0 v_~y$flush_delayed~0_49) (= 0 v_~y$read_delayed_var~0.base_5) (= v_~y$r_buff0_thd1~0_36 0) (= v_~y$w_buff0_used~0_832 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t605~0.base_29|) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t605~0.base_29| 4) |v_#length_31|) (= (select .cse0 |v_ULTIMATE.start_main_~#t605~0.base_29|) 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= 0 v_~y$r_buff1_thd4~0_202) (= v_~a~0_49 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t605~0.base_29| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t605~0.base_29|) |v_ULTIMATE.start_main_~#t605~0.offset_21| 0)) |v_#memory_int_29|) (= 0 v_~y$r_buff1_thd2~0_315) (= v_~y$r_buff0_thd0~0_117 0) (= 0 |v_#NULL.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_~#t605~0.base_29| 1) |v_#valid_72|) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= 0 v_~y$r_buff0_thd3~0_225) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~__unbuffered_p3_EAX~0_48) (= |v_#NULL.offset_4| 0) (= 0 v_~y$r_buff0_thd4~0_120) (= v_~weak$$choice2~0_186 0) (= v_~y$r_buff1_thd0~0_220 0) (= 0 |v_ULTIMATE.start_main_~#t605~0.offset_21|) (= v_~z~0_163 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t607~0.base=|v_ULTIMATE.start_main_~#t607~0.base_29|, ULTIMATE.start_main_~#t605~0.offset=|v_ULTIMATE.start_main_~#t605~0.offset_21|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_82|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_49, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_189, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_36, ~y$flush_delayed~0=v_~y$flush_delayed~0_49, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_48, #length=|v_#length_31|, ULTIMATE.start_main_~#t607~0.offset=|v_ULTIMATE.start_main_~#t607~0.offset_21|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_29|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_202, ULTIMATE.start_main_~#t608~0.offset=|v_ULTIMATE.start_main_~#t608~0.offset_16|, ~y$w_buff1~0=v_~y$w_buff1~0_278, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_330, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_187, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_220, ~x~0=v_~x~0_72, ULTIMATE.start_main_~#t605~0.base=|v_ULTIMATE.start_main_~#t605~0.base_29|, ~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_832, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ULTIMATE.start_main_~#t606~0.offset=|v_ULTIMATE.start_main_~#t606~0.offset_21|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_122, ~y$w_buff0~0=v_~y$w_buff0~0_386, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_225, ULTIMATE.start_main_~#t606~0.base=|v_ULTIMATE.start_main_~#t606~0.base_29|, ~y~0=v_~y~0_163, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_48, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_315, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_120, ULTIMATE.start_main_~#t608~0.base=|v_ULTIMATE.start_main_~#t608~0.base_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_117, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_186, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_529} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t607~0.base, ULTIMATE.start_main_~#t605~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t607~0.offset, ULTIMATE.start_main_#t~nondet41, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ULTIMATE.start_main_~#t608~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t605~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t606~0.offset, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t606~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t608~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 16:21:51,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L846-1-->L848: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t606~0.offset_10|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t606~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t606~0.base_12| 0)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t606~0.base_12| 4) |v_#length_19|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t606~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t606~0.base_12|) |v_ULTIMATE.start_main_~#t606~0.offset_10| 1)) |v_#memory_int_17|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t606~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t606~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t606~0.offset=|v_ULTIMATE.start_main_~#t606~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t606~0.base=|v_ULTIMATE.start_main_~#t606~0.base_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t606~0.offset, ULTIMATE.start_main_~#t606~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 16:21:51,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-1-->L850: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t607~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t607~0.base_13|) |v_ULTIMATE.start_main_~#t607~0.offset_11| 2)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t607~0.base_13|)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t607~0.base_13|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t607~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t607~0.offset_11|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t607~0.base_13|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t607~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t607~0.base=|v_ULTIMATE.start_main_~#t607~0.base_13|, ULTIMATE.start_main_~#t607~0.offset=|v_ULTIMATE.start_main_~#t607~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t607~0.base, ULTIMATE.start_main_~#t607~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 16:21:51,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L4-->L800: Formula: (and (= v_~y$r_buff0_thd4~0_25 v_~y$r_buff1_thd4~0_25) (= v_~y$r_buff0_thd3~0_17 1) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24 0)) (= v_~y$r_buff0_thd3~0_18 v_~y$r_buff1_thd3~0_11) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff1_thd2~0_32) (= v_~z~0_10 1) (= v_~y$r_buff0_thd0~0_19 v_~y$r_buff1_thd0~0_17)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_32, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_11, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_17, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24, ~z~0=v_~z~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 16:21:51,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L850-1-->L852: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t608~0.base_10| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t608~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t608~0.base_10|) |v_ULTIMATE.start_main_~#t608~0.offset_10| 3)) |v_#memory_int_15|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t608~0.base_10|)) (= |v_ULTIMATE.start_main_~#t608~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t608~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t608~0.base_10|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t608~0.base_10| 1) |v_#valid_38|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ULTIMATE.start_main_~#t608~0.offset=|v_ULTIMATE.start_main_~#t608~0.offset_10|, ULTIMATE.start_main_~#t608~0.base=|v_ULTIMATE.start_main_~#t608~0.base_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t608~0.offset, ULTIMATE.start_main_~#t608~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 16:21:51,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_23 1) (= v_~x~0_36 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_~__unbuffered_cnt~0_101 (+ v_~__unbuffered_cnt~0_102 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|} OutVars{~a~0=v_~a~0_23, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 16:21:51,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L823-2-->L823-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1189501823 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd4~0_In-1189501823 256) 0))) (or (and (= ~y$w_buff1~0_In-1189501823 |P3Thread1of1ForFork0_#t~ite32_Out-1189501823|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite32_Out-1189501823| ~y~0_In-1189501823)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1189501823, ~y$w_buff1~0=~y$w_buff1~0_In-1189501823, ~y~0=~y~0_In-1189501823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1189501823} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1189501823, ~y$w_buff1~0=~y$w_buff1~0_In-1189501823, ~y~0=~y~0_In-1189501823, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-1189501823|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1189501823} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 16:21:51,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L823-4-->L824: Formula: (= v_~y~0_43 |v_P3Thread1of1ForFork0_#t~ite32_14|) InVars {P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_14|} OutVars{~y~0=v_~y~0_43, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_15|, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_13|} AuxVars[] AssignedVars[~y~0, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 16:21:51,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd4~0_In-1078474468 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1078474468 256)))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out-1078474468|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1078474468 |P3Thread1of1ForFork0_#t~ite34_Out-1078474468|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1078474468, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1078474468} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1078474468, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1078474468, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-1078474468|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-27 16:21:51,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1014206952 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1014206952 256)))) (or (and (= |P2Thread1of1ForFork3_#t~ite28_Out1014206952| ~y$w_buff0_used~0_In1014206952) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork3_#t~ite28_Out1014206952| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1014206952, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1014206952} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1014206952, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1014206952, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out1014206952|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-27 16:21:51,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L802-->L802-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1996476522 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-1996476522 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1996476522 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1996476522 256)))) (or (and (= |P2Thread1of1ForFork3_#t~ite29_Out-1996476522| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork3_#t~ite29_Out-1996476522| ~y$w_buff1_used~0_In-1996476522) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1996476522, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1996476522, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1996476522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1996476522} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1996476522, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1996476522, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1996476522, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-1996476522|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1996476522} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-27 16:21:51,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L803-->L804: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In2043871800 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In2043871800 256) 0))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out2043871800) (not .cse1)) (and (= ~y$r_buff0_thd3~0_Out2043871800 ~y$r_buff0_thd3~0_In2043871800) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2043871800, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2043871800} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out2043871800|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2043871800, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out2043871800} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 16:21:51,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1687499744 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1687499744 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1687499744 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1687499744 256) 0))) (or (and (= 0 |P2Thread1of1ForFork3_#t~ite31_Out1687499744|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite31_Out1687499744| ~y$r_buff1_thd3~0_In1687499744) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1687499744, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1687499744, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1687499744, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1687499744} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1687499744, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1687499744, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1687499744, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out1687499744|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1687499744} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-27 16:21:51,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L804-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#t~ite31_40| v_~y$r_buff1_thd3~0_125) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_126 (+ v_~__unbuffered_cnt~0_127 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_125, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 16:21:51,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1556112455 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In1556112455 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd4~0_In1556112455 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1556112455 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork0_#t~ite35_Out1556112455| ~y$w_buff1_used~0_In1556112455)) (and (= |P3Thread1of1ForFork0_#t~ite35_Out1556112455| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1556112455, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1556112455, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1556112455, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1556112455} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1556112455, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1556112455, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1556112455, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out1556112455|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1556112455} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-27 16:21:51,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-1914851469 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1914851469 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-1914851469|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd4~0_In-1914851469 |P3Thread1of1ForFork0_#t~ite36_Out-1914851469|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1914851469, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1914851469} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1914851469, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1914851469, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-1914851469|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-27 16:21:51,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L827-->L827-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In1576807520 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1576807520 256))) (.cse1 (= (mod ~y$r_buff0_thd4~0_In1576807520 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1576807520 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite37_Out1576807520|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite37_Out1576807520| ~y$r_buff1_thd4~0_In1576807520)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1576807520, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1576807520, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1576807520, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1576807520} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1576807520, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1576807520, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1576807520, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out1576807520|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1576807520} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-27 16:21:51,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L827-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= |v_P3Thread1of1ForFork0_#t~ite37_48| v_~y$r_buff1_thd4~0_61) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_61, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_47|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:21:51,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L764-->L764-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2021109644 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2021109644 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In2021109644 256) 0) .cse0) (and (= (mod ~y$w_buff1_used~0_In2021109644 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In2021109644 256) 0))) (= ~y$w_buff0~0_In2021109644 |P1Thread1of1ForFork2_#t~ite8_Out2021109644|) .cse1 (= |P1Thread1of1ForFork2_#t~ite8_Out2021109644| |P1Thread1of1ForFork2_#t~ite9_Out2021109644|)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite8_In2021109644| |P1Thread1of1ForFork2_#t~ite8_Out2021109644|) (= ~y$w_buff0~0_In2021109644 |P1Thread1of1ForFork2_#t~ite9_Out2021109644|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2021109644, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2021109644, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In2021109644|, ~y$w_buff0~0=~y$w_buff0~0_In2021109644, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2021109644, ~weak$$choice2~0=~weak$$choice2~0_In2021109644, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2021109644} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2021109644, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out2021109644|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2021109644, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out2021109644|, ~y$w_buff0~0=~y$w_buff0~0_In2021109644, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2021109644, ~weak$$choice2~0=~weak$$choice2~0_In2021109644, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2021109644} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 16:21:51,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L766-->L766-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In353125618 256) 0))) (or (and .cse0 (= ~y$w_buff0_used~0_In353125618 |P1Thread1of1ForFork2_#t~ite14_Out353125618|) (= |P1Thread1of1ForFork2_#t~ite15_Out353125618| |P1Thread1of1ForFork2_#t~ite14_Out353125618|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In353125618 256)))) (or (and (= (mod ~y$w_buff1_used~0_In353125618 256) 0) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In353125618 256) 0)) (= (mod ~y$w_buff0_used~0_In353125618 256) 0)))) (and (= |P1Thread1of1ForFork2_#t~ite14_In353125618| |P1Thread1of1ForFork2_#t~ite14_Out353125618|) (not .cse0) (= ~y$w_buff0_used~0_In353125618 |P1Thread1of1ForFork2_#t~ite15_Out353125618|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In353125618, ~y$w_buff0_used~0=~y$w_buff0_used~0_In353125618, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In353125618, ~weak$$choice2~0=~weak$$choice2~0_In353125618, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In353125618|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In353125618} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In353125618, ~y$w_buff0_used~0=~y$w_buff0_used~0_In353125618, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In353125618, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out353125618|, ~weak$$choice2~0=~weak$$choice2~0_In353125618, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out353125618|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In353125618} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 16:21:51,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L768-->L769: Formula: (and (= v_~y$r_buff0_thd2~0_109 v_~y$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_15|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 16:21:51,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L769-->L769-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-580837282 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite23_In-580837282| |P1Thread1of1ForFork2_#t~ite23_Out-580837282|) (= ~y$r_buff1_thd2~0_In-580837282 |P1Thread1of1ForFork2_#t~ite24_Out-580837282|) (not .cse0)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-580837282 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-580837282 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-580837282 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-580837282 256))))) (= |P1Thread1of1ForFork2_#t~ite23_Out-580837282| |P1Thread1of1ForFork2_#t~ite24_Out-580837282|) (= ~y$r_buff1_thd2~0_In-580837282 |P1Thread1of1ForFork2_#t~ite23_Out-580837282|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-580837282, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-580837282, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-580837282, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-580837282|, ~weak$$choice2~0=~weak$$choice2~0_In-580837282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-580837282} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-580837282, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-580837282, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-580837282, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-580837282|, ~weak$$choice2~0=~weak$$choice2~0_In-580837282, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-580837282|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-580837282} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 16:21:51,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L779: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= v_~y~0_19 v_~y$mem_tmp~0_4) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, ~y~0=v_~y~0_19, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 16:21:51,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L852-1-->L858: Formula: (and (= 4 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:21:51,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L858-2-->L858-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-826034380 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite43_Out-826034380| |ULTIMATE.start_main_#t~ite42_Out-826034380|)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-826034380 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-826034380 |ULTIMATE.start_main_#t~ite42_Out-826034380|) .cse2) (and (= ~y$w_buff1~0_In-826034380 |ULTIMATE.start_main_#t~ite42_Out-826034380|) (not .cse0) .cse2 (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-826034380, ~y~0=~y~0_In-826034380, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-826034380, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-826034380} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-826034380, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-826034380|, ~y~0=~y~0_In-826034380, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-826034380|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-826034380, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-826034380} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:21:51,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L859-->L859-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-449976368 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-449976368 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-449976368| ~y$w_buff0_used~0_In-449976368) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-449976368|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-449976368, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-449976368} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-449976368, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-449976368, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-449976368|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 16:21:51,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L860-->L860-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In303318246 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In303318246 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In303318246 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In303318246 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out303318246| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out303318246| ~y$w_buff1_used~0_In303318246)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In303318246, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In303318246, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In303318246, ~y$w_buff1_used~0=~y$w_buff1_used~0_In303318246} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In303318246, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In303318246, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In303318246, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out303318246|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In303318246} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 16:21:51,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L861-->L861-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1241388700 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1241388700 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1241388700 |ULTIMATE.start_main_#t~ite46_Out1241388700|)) (and (= |ULTIMATE.start_main_#t~ite46_Out1241388700| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1241388700, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1241388700} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1241388700, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1241388700, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1241388700|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 16:21:51,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L862-->L862-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In2145728471 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2145728471 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In2145728471 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In2145728471 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite47_Out2145728471|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In2145728471 |ULTIMATE.start_main_#t~ite47_Out2145728471|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2145728471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2145728471, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2145728471, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2145728471} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2145728471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2145728471, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2145728471|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2145728471, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2145728471} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 16:21:51,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L862-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p1_EAX~0_26) (= 2 v_~__unbuffered_p3_EAX~0_24) (= v_~__unbuffered_p1_EBX~0_25 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~y$r_buff1_thd0~0_153 |v_ULTIMATE.start_main_#t~ite47_41|) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~x~0_45 2) (= v_~main$tmp_guard1~0_19 0) (= v_~z~0_103 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_41|, ~z~0=v_~z~0_103, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_45} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~z~0=v_~z~0_103, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_45, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:21:51,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:21:51 BasicIcfg [2019-12-27 16:21:51,675 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:21:51,677 INFO L168 Benchmark]: Toolchain (without parser) took 191217.89 ms. Allocated memory was 139.5 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 102.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 16:21:51,678 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 16:21:51,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 850.77 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.4 MB in the beginning and 157.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:21:51,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.87 ms. Allocated memory is still 204.5 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:21:51,680 INFO L168 Benchmark]: Boogie Preprocessor took 44.35 ms. Allocated memory is still 204.5 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:21:51,680 INFO L168 Benchmark]: RCFGBuilder took 934.26 ms. Allocated memory is still 204.5 MB. Free memory was 152.2 MB in the beginning and 103.2 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:21:51,681 INFO L168 Benchmark]: TraceAbstraction took 189311.52 ms. Allocated memory was 204.5 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 103.2 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 16:21:51,684 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.18 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 850.77 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.4 MB in the beginning and 157.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.87 ms. Allocated memory is still 204.5 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.35 ms. Allocated memory is still 204.5 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 934.26 ms. Allocated memory is still 204.5 MB. Free memory was 152.2 MB in the beginning and 103.2 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 189311.52 ms. Allocated memory was 204.5 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 103.2 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 181 ProgramPointsBefore, 88 ProgramPointsAfterwards, 209 TransitionsBefore, 95 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 7917 VarBasedMoverChecksPositive, 267 VarBasedMoverChecksNegative, 87 SemBasedMoverChecksPositive, 235 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 66461 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L846] FCALL, FORK 0 pthread_create(&t605, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L848] FCALL, FORK 0 pthread_create(&t606, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L850] FCALL, FORK 0 pthread_create(&t607, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L784] 3 y$w_buff1 = y$w_buff0 [L785] 3 y$w_buff0 = 1 [L786] 3 y$w_buff1_used = y$w_buff0_used [L787] 3 y$w_buff0_used = (_Bool)1 [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L852] FCALL, FORK 0 pthread_create(&t608, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L814] 4 z = 2 [L817] 4 __unbuffered_p3_EAX = z [L820] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L823] 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L753] 2 x = 2 [L756] 2 __unbuffered_p1_EAX = x [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 y$flush_delayed = weak$$choice2 [L762] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L763] 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, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L800] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L763] 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) [L801] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L825] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L764] 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)) [L765] EXPR 2 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, 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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L765] 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)) [L766] 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)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L767] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 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)) [L770] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L858] EXPR 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L858] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 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 [L861] 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 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 188.9s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 91.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5005 SDtfs, 9996 SDslu, 28956 SDs, 0 SdLazy, 37499 SolverSat, 1132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 874 GetRequests, 102 SyntacticMatches, 40 SemanticMatches, 732 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60401 ImplicationChecksByTransitivity, 32.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160898occurred 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: 46.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 256399 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 901 NumberOfCodeBlocks, 901 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 822 ConstructedInterpolants, 0 QuantifiedInterpolants, 177036 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...