/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:34:11,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:34:11,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:34:11,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:34:11,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:34:11,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:34:11,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:34:11,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:34:11,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:34:11,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:34:11,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:34:11,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:34:11,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:34:11,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:34:11,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:34:11,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:34:11,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:34:11,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:34:11,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:34:11,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:34:11,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:34:11,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:34:11,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:34:11,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:34:11,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:34:11,346 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:34:11,346 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:34:11,347 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:34:11,347 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:34:11,348 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:34:11,349 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:34:11,350 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:34:11,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:34:11,351 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:34:11,352 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:34:11,352 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:34:11,353 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:34:11,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:34:11,354 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:34:11,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:34:11,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:34:11,356 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:34:11,381 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:34:11,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:34:11,385 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:34:11,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:34:11,386 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:34:11,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:34:11,386 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:34:11,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:34:11,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:34:11,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:34:11,388 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:34:11,388 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:34:11,389 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:34:11,389 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:34:11,389 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:34:11,389 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:34:11,389 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:34:11,390 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:34:11,390 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:34:11,390 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:34:11,391 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:34:11,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:34:11,391 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:34:11,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:34:11,392 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:34:11,392 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:34:11,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:34:11,393 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:34:11,393 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:34:11,393 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:34:11,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:34:11,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:34:11,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:34:11,740 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:34:11,741 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:34:11,742 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_pso.opt.i [2019-12-18 21:34:11,807 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5483190/3cc0c5b154f8419491975ed0e49a735e/FLAG444e18b14 [2019-12-18 21:34:12,354 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:34:12,355 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_pso.opt.i [2019-12-18 21:34:12,370 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5483190/3cc0c5b154f8419491975ed0e49a735e/FLAG444e18b14 [2019-12-18 21:34:12,621 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5483190/3cc0c5b154f8419491975ed0e49a735e [2019-12-18 21:34:12,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:34:12,631 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:34:12,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:34:12,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:34:12,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:34:12,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:34:12" (1/1) ... [2019-12-18 21:34:12,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e76b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:12, skipping insertion in model container [2019-12-18 21:34:12,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:34:12" (1/1) ... [2019-12-18 21:34:12,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:34:12,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:34:13,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:34:13,236 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:34:13,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:34:13,376 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:34:13,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:13 WrapperNode [2019-12-18 21:34:13,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:34:13,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:34:13,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:34:13,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:34:13,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:13" (1/1) ... [2019-12-18 21:34:13,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:13" (1/1) ... [2019-12-18 21:34:13,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:34:13,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:34:13,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:34:13,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:34:13,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:13" (1/1) ... [2019-12-18 21:34:13,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:13" (1/1) ... [2019-12-18 21:34:13,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:13" (1/1) ... [2019-12-18 21:34:13,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:13" (1/1) ... [2019-12-18 21:34:13,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:13" (1/1) ... [2019-12-18 21:34:13,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:13" (1/1) ... [2019-12-18 21:34:13,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:13" (1/1) ... [2019-12-18 21:34:13,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:34:13,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:34:13,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:34:13,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:34:13,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:13" (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-18 21:34:13,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:34:13,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:34:13,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:34:13,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:34:13,588 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:34:13,588 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:34:13,588 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:34:13,588 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:34:13,589 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:34:13,589 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:34:13,589 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:34:13,589 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:34:13,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:34:13,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:34:13,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:34:13,592 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:34:14,387 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:34:14,387 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:34:14,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:34:14 BoogieIcfgContainer [2019-12-18 21:34:14,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:34:14,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:34:14,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:34:14,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:34:14,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:34:12" (1/3) ... [2019-12-18 21:34:14,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe47363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:34:14, skipping insertion in model container [2019-12-18 21:34:14,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:34:13" (2/3) ... [2019-12-18 21:34:14,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe47363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:34:14, skipping insertion in model container [2019-12-18 21:34:14,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:34:14" (3/3) ... [2019-12-18 21:34:14,398 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_pso.opt.i [2019-12-18 21:34:14,407 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:34:14,407 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:34:14,414 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:34:14,416 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:34:14,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,455 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,455 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,457 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,457 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,459 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,459 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,467 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,468 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,468 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,468 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,468 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,468 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,469 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,484 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,485 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,486 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,486 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,486 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,486 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,487 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,487 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,487 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,487 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,488 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,488 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,488 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,488 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,488 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,489 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,489 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,489 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,489 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,490 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,490 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,490 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,490 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,490 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,491 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,491 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,491 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,495 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,496 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,498 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,499 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,502 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,502 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,505 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,506 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,506 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,506 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,506 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,506 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,507 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,507 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,507 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,507 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,507 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,508 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:34:14,523 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:34:14,543 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:34:14,543 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:34:14,544 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:34:14,544 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:34:14,544 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:34:14,544 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:34:14,544 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:34:14,544 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:34:14,563 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-18 21:34:14,565 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 21:34:14,652 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 21:34:14,652 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:34:14,668 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:34:14,689 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 21:34:14,734 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 21:34:14,735 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:34:14,741 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:34:14,757 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 21:34:14,758 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:34:18,367 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 21:34:18,507 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 21:34:18,569 INFO L206 etLargeBlockEncoding]: Checked pairs total: 52826 [2019-12-18 21:34:18,570 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 21:34:18,574 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 99 transitions [2019-12-18 21:34:21,934 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 38654 states. [2019-12-18 21:34:21,936 INFO L276 IsEmpty]: Start isEmpty. Operand 38654 states. [2019-12-18 21:34:21,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:34:21,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:21,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:21,946 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:21,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:21,952 INFO L82 PathProgramCache]: Analyzing trace with hash -313660218, now seen corresponding path program 1 times [2019-12-18 21:34:21,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:21,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245753459] [2019-12-18 21:34:21,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:22,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-18 21:34:22,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245753459] [2019-12-18 21:34:22,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:22,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:34:22,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422905468] [2019-12-18 21:34:22,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:34:22,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:22,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:34:22,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:34:22,290 INFO L87 Difference]: Start difference. First operand 38654 states. Second operand 3 states. [2019-12-18 21:34:23,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:23,088 INFO L93 Difference]: Finished difference Result 36046 states and 153176 transitions. [2019-12-18 21:34:23,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:34:23,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:34:23,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:23,689 INFO L225 Difference]: With dead ends: 36046 [2019-12-18 21:34:23,689 INFO L226 Difference]: Without dead ends: 35318 [2019-12-18 21:34:23,700 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-18 21:34:24,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35318 states. [2019-12-18 21:34:25,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35318 to 35318. [2019-12-18 21:34:25,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35318 states. [2019-12-18 21:34:27,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35318 states to 35318 states and 150208 transitions. [2019-12-18 21:34:27,571 INFO L78 Accepts]: Start accepts. Automaton has 35318 states and 150208 transitions. Word has length 9 [2019-12-18 21:34:27,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:27,574 INFO L462 AbstractCegarLoop]: Abstraction has 35318 states and 150208 transitions. [2019-12-18 21:34:27,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:34:27,574 INFO L276 IsEmpty]: Start isEmpty. Operand 35318 states and 150208 transitions. [2019-12-18 21:34:27,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:34:27,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:27,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:27,594 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:27,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:27,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1224255535, now seen corresponding path program 1 times [2019-12-18 21:34:27,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:27,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442903541] [2019-12-18 21:34:27,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:27,758 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-18 21:34:27,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442903541] [2019-12-18 21:34:27,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:27,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:34:27,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44259642] [2019-12-18 21:34:27,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:34:27,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:27,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:34:27,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:34:27,763 INFO L87 Difference]: Start difference. First operand 35318 states and 150208 transitions. Second operand 4 states. [2019-12-18 21:34:28,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:28,489 INFO L93 Difference]: Finished difference Result 54990 states and 226052 transitions. [2019-12-18 21:34:28,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:34:28,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:34:28,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:29,222 INFO L225 Difference]: With dead ends: 54990 [2019-12-18 21:34:29,222 INFO L226 Difference]: Without dead ends: 54962 [2019-12-18 21:34:29,223 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-18 21:34:29,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54962 states. [2019-12-18 21:34:31,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54962 to 50002. [2019-12-18 21:34:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50002 states. [2019-12-18 21:34:31,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50002 states to 50002 states and 207548 transitions. [2019-12-18 21:34:31,203 INFO L78 Accepts]: Start accepts. Automaton has 50002 states and 207548 transitions. Word has length 15 [2019-12-18 21:34:31,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:31,204 INFO L462 AbstractCegarLoop]: Abstraction has 50002 states and 207548 transitions. [2019-12-18 21:34:31,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:34:31,204 INFO L276 IsEmpty]: Start isEmpty. Operand 50002 states and 207548 transitions. [2019-12-18 21:34:31,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:34:31,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:31,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:31,207 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:31,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:31,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1764776836, now seen corresponding path program 1 times [2019-12-18 21:34:31,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:31,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010199207] [2019-12-18 21:34:31,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:31,250 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-18 21:34:31,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010199207] [2019-12-18 21:34:31,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:31,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:34:31,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72314517] [2019-12-18 21:34:31,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:34:31,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:31,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:34:31,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:34:31,252 INFO L87 Difference]: Start difference. First operand 50002 states and 207548 transitions. Second operand 3 states. [2019-12-18 21:34:33,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:33,029 INFO L93 Difference]: Finished difference Result 39218 states and 150397 transitions. [2019-12-18 21:34:33,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:34:33,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 21:34:33,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:33,195 INFO L225 Difference]: With dead ends: 39218 [2019-12-18 21:34:33,196 INFO L226 Difference]: Without dead ends: 39218 [2019-12-18 21:34:33,196 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-18 21:34:33,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39218 states. [2019-12-18 21:34:34,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39218 to 39218. [2019-12-18 21:34:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39218 states. [2019-12-18 21:34:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39218 states to 39218 states and 150397 transitions. [2019-12-18 21:34:34,451 INFO L78 Accepts]: Start accepts. Automaton has 39218 states and 150397 transitions. Word has length 15 [2019-12-18 21:34:34,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:34,451 INFO L462 AbstractCegarLoop]: Abstraction has 39218 states and 150397 transitions. [2019-12-18 21:34:34,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:34:34,451 INFO L276 IsEmpty]: Start isEmpty. Operand 39218 states and 150397 transitions. [2019-12-18 21:34:34,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:34:34,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:34,456 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:34,456 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:34,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:34,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1883411785, now seen corresponding path program 1 times [2019-12-18 21:34:34,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:34,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610108114] [2019-12-18 21:34:34,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:34,505 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-18 21:34:34,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610108114] [2019-12-18 21:34:34,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:34,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:34:34,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306167774] [2019-12-18 21:34:34,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:34:34,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:34,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:34:34,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:34:34,507 INFO L87 Difference]: Start difference. First operand 39218 states and 150397 transitions. Second operand 4 states. [2019-12-18 21:34:34,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:34,589 INFO L93 Difference]: Finished difference Result 16304 states and 51852 transitions. [2019-12-18 21:34:34,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:34:34,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:34:34,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:34,619 INFO L225 Difference]: With dead ends: 16304 [2019-12-18 21:34:34,620 INFO L226 Difference]: Without dead ends: 16304 [2019-12-18 21:34:34,620 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-18 21:34:34,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16304 states. [2019-12-18 21:34:34,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16304 to 16304. [2019-12-18 21:34:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16304 states. [2019-12-18 21:34:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16304 states to 16304 states and 51852 transitions. [2019-12-18 21:34:35,432 INFO L78 Accepts]: Start accepts. Automaton has 16304 states and 51852 transitions. Word has length 16 [2019-12-18 21:34:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:35,432 INFO L462 AbstractCegarLoop]: Abstraction has 16304 states and 51852 transitions. [2019-12-18 21:34:35,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:34:35,432 INFO L276 IsEmpty]: Start isEmpty. Operand 16304 states and 51852 transitions. [2019-12-18 21:34:35,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:34:35,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:35,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:34:35,435 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:35,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:35,435 INFO L82 PathProgramCache]: Analyzing trace with hash 471912602, now seen corresponding path program 1 times [2019-12-18 21:34:35,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:35,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515297332] [2019-12-18 21:34:35,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:35,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-18 21:34:35,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515297332] [2019-12-18 21:34:35,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:35,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:34:35,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749604279] [2019-12-18 21:34:35,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:34:35,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:35,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:34:35,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:34:35,495 INFO L87 Difference]: Start difference. First operand 16304 states and 51852 transitions. Second operand 5 states. [2019-12-18 21:34:35,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:35,537 INFO L93 Difference]: Finished difference Result 2786 states and 7200 transitions. [2019-12-18 21:34:35,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:34:35,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 21:34:35,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:35,542 INFO L225 Difference]: With dead ends: 2786 [2019-12-18 21:34:35,542 INFO L226 Difference]: Without dead ends: 2786 [2019-12-18 21:34:35,543 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-18 21:34:35,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2019-12-18 21:34:35,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 2786. [2019-12-18 21:34:35,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2786 states. [2019-12-18 21:34:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 7200 transitions. [2019-12-18 21:34:35,579 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 7200 transitions. Word has length 17 [2019-12-18 21:34:35,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:35,580 INFO L462 AbstractCegarLoop]: Abstraction has 2786 states and 7200 transitions. [2019-12-18 21:34:35,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:34:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 7200 transitions. [2019-12-18 21:34:35,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:34:35,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:35,585 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] [2019-12-18 21:34:35,585 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:35,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:35,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1539396208, now seen corresponding path program 1 times [2019-12-18 21:34:35,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:35,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610864756] [2019-12-18 21:34:35,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:35,678 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-18 21:34:35,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610864756] [2019-12-18 21:34:35,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:35,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:34:35,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461912960] [2019-12-18 21:34:35,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:34:35,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:35,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:34:35,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:34:35,680 INFO L87 Difference]: Start difference. First operand 2786 states and 7200 transitions. Second operand 6 states. [2019-12-18 21:34:35,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:35,732 INFO L93 Difference]: Finished difference Result 1356 states and 3887 transitions. [2019-12-18 21:34:35,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:34:35,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 21:34:35,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:35,735 INFO L225 Difference]: With dead ends: 1356 [2019-12-18 21:34:35,736 INFO L226 Difference]: Without dead ends: 1356 [2019-12-18 21:34:35,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:34:35,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2019-12-18 21:34:35,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1216. [2019-12-18 21:34:35,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2019-12-18 21:34:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 3487 transitions. [2019-12-18 21:34:35,757 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 3487 transitions. Word has length 29 [2019-12-18 21:34:35,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:35,758 INFO L462 AbstractCegarLoop]: Abstraction has 1216 states and 3487 transitions. [2019-12-18 21:34:35,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:34:35,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 3487 transitions. [2019-12-18 21:34:35,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:34:35,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:35,762 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-18 21:34:35,763 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:35,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:35,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1329665717, now seen corresponding path program 1 times [2019-12-18 21:34:35,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:35,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961730266] [2019-12-18 21:34:35,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:35,885 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-18 21:34:35,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961730266] [2019-12-18 21:34:35,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:35,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:34:35,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205429272] [2019-12-18 21:34:35,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:34:35,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:35,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:34:35,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:34:35,887 INFO L87 Difference]: Start difference. First operand 1216 states and 3487 transitions. Second operand 3 states. [2019-12-18 21:34:35,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:35,939 INFO L93 Difference]: Finished difference Result 1224 states and 3495 transitions. [2019-12-18 21:34:35,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:34:35,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 21:34:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:35,942 INFO L225 Difference]: With dead ends: 1224 [2019-12-18 21:34:35,942 INFO L226 Difference]: Without dead ends: 1224 [2019-12-18 21:34:35,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:34:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-12-18 21:34:35,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1219. [2019-12-18 21:34:35,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2019-12-18 21:34:35,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 3490 transitions. [2019-12-18 21:34:35,963 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 3490 transitions. Word has length 58 [2019-12-18 21:34:35,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:35,963 INFO L462 AbstractCegarLoop]: Abstraction has 1219 states and 3490 transitions. [2019-12-18 21:34:35,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:34:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 3490 transitions. [2019-12-18 21:34:35,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:34:35,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:35,968 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-18 21:34:35,968 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:35,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:35,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1606563127, now seen corresponding path program 1 times [2019-12-18 21:34:35,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:35,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074753947] [2019-12-18 21:34:35,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:36,083 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-18 21:34:36,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074753947] [2019-12-18 21:34:36,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:36,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:34:36,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717796708] [2019-12-18 21:34:36,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:34:36,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:36,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:34:36,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:34:36,085 INFO L87 Difference]: Start difference. First operand 1219 states and 3490 transitions. Second operand 5 states. [2019-12-18 21:34:36,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:36,330 INFO L93 Difference]: Finished difference Result 1760 states and 5012 transitions. [2019-12-18 21:34:36,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:34:36,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 21:34:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:36,334 INFO L225 Difference]: With dead ends: 1760 [2019-12-18 21:34:36,334 INFO L226 Difference]: Without dead ends: 1760 [2019-12-18 21:34:36,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:34:36,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2019-12-18 21:34:36,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1415. [2019-12-18 21:34:36,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1415 states. [2019-12-18 21:34:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 4066 transitions. [2019-12-18 21:34:36,362 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 4066 transitions. Word has length 58 [2019-12-18 21:34:36,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:36,363 INFO L462 AbstractCegarLoop]: Abstraction has 1415 states and 4066 transitions. [2019-12-18 21:34:36,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:34:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 4066 transitions. [2019-12-18 21:34:36,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:34:36,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:36,368 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-18 21:34:36,369 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:36,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:36,369 INFO L82 PathProgramCache]: Analyzing trace with hash 595510245, now seen corresponding path program 2 times [2019-12-18 21:34:36,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:36,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663061210] [2019-12-18 21:34:36,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:36,500 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-18 21:34:36,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663061210] [2019-12-18 21:34:36,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:36,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:34:36,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977593760] [2019-12-18 21:34:36,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:34:36,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:36,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:34:36,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:34:36,503 INFO L87 Difference]: Start difference. First operand 1415 states and 4066 transitions. Second operand 6 states. [2019-12-18 21:34:36,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:36,875 INFO L93 Difference]: Finished difference Result 2366 states and 6730 transitions. [2019-12-18 21:34:36,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:34:36,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 21:34:36,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:36,880 INFO L225 Difference]: With dead ends: 2366 [2019-12-18 21:34:36,881 INFO L226 Difference]: Without dead ends: 2366 [2019-12-18 21:34:36,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:34:36,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2019-12-18 21:34:36,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 1499. [2019-12-18 21:34:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2019-12-18 21:34:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 4314 transitions. [2019-12-18 21:34:36,904 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 4314 transitions. Word has length 58 [2019-12-18 21:34:36,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:36,904 INFO L462 AbstractCegarLoop]: Abstraction has 1499 states and 4314 transitions. [2019-12-18 21:34:36,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:34:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 4314 transitions. [2019-12-18 21:34:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:34:36,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:36,909 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-18 21:34:36,909 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:36,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:36,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1233712533, now seen corresponding path program 3 times [2019-12-18 21:34:36,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:36,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821277995] [2019-12-18 21:34:36,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:37,024 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-18 21:34:37,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821277995] [2019-12-18 21:34:37,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:37,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:34:37,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080191060] [2019-12-18 21:34:37,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:34:37,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:37,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:34:37,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:34:37,026 INFO L87 Difference]: Start difference. First operand 1499 states and 4314 transitions. Second operand 6 states. [2019-12-18 21:34:37,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:37,396 INFO L93 Difference]: Finished difference Result 2373 states and 6750 transitions. [2019-12-18 21:34:37,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:34:37,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 21:34:37,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:37,404 INFO L225 Difference]: With dead ends: 2373 [2019-12-18 21:34:37,404 INFO L226 Difference]: Without dead ends: 2373 [2019-12-18 21:34:37,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:34:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2019-12-18 21:34:37,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 1687. [2019-12-18 21:34:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1687 states. [2019-12-18 21:34:37,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 4858 transitions. [2019-12-18 21:34:37,428 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 4858 transitions. Word has length 58 [2019-12-18 21:34:37,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:37,429 INFO L462 AbstractCegarLoop]: Abstraction has 1687 states and 4858 transitions. [2019-12-18 21:34:37,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:34:37,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 4858 transitions. [2019-12-18 21:34:37,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:34:37,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:37,433 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-18 21:34:37,433 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:37,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:37,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1959735343, now seen corresponding path program 4 times [2019-12-18 21:34:37,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:37,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235212763] [2019-12-18 21:34:37,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:37,543 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-18 21:34:37,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235212763] [2019-12-18 21:34:37,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:37,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:34:37,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45669322] [2019-12-18 21:34:37,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:34:37,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:37,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:34:37,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:34:37,545 INFO L87 Difference]: Start difference. First operand 1687 states and 4858 transitions. Second operand 7 states. [2019-12-18 21:34:37,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:37,962 INFO L93 Difference]: Finished difference Result 2630 states and 7482 transitions. [2019-12-18 21:34:37,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:34:37,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-18 21:34:37,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:37,968 INFO L225 Difference]: With dead ends: 2630 [2019-12-18 21:34:37,968 INFO L226 Difference]: Without dead ends: 2630 [2019-12-18 21:34:37,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:34:37,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2019-12-18 21:34:38,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 1603. [2019-12-18 21:34:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2019-12-18 21:34:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 4610 transitions. [2019-12-18 21:34:38,006 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 4610 transitions. Word has length 58 [2019-12-18 21:34:38,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:38,006 INFO L462 AbstractCegarLoop]: Abstraction has 1603 states and 4610 transitions. [2019-12-18 21:34:38,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:34:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 4610 transitions. [2019-12-18 21:34:38,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:34:38,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:38,011 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-18 21:34:38,011 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:38,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:38,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1379010492, now seen corresponding path program 1 times [2019-12-18 21:34:38,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:38,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931436988] [2019-12-18 21:34:38,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:38,279 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-18 21:34:38,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931436988] [2019-12-18 21:34:38,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:38,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:34:38,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252626401] [2019-12-18 21:34:38,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:34:38,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:38,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:34:38,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:34:38,282 INFO L87 Difference]: Start difference. First operand 1603 states and 4610 transitions. Second operand 12 states. [2019-12-18 21:34:38,702 WARN L192 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-12-18 21:34:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:40,044 INFO L93 Difference]: Finished difference Result 4255 states and 11319 transitions. [2019-12-18 21:34:40,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 21:34:40,045 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-18 21:34:40,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:40,049 INFO L225 Difference]: With dead ends: 4255 [2019-12-18 21:34:40,049 INFO L226 Difference]: Without dead ends: 2558 [2019-12-18 21:34:40,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=277, Invalid=1129, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 21:34:40,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2019-12-18 21:34:40,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 1473. [2019-12-18 21:34:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1473 states. [2019-12-18 21:34:40,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 4170 transitions. [2019-12-18 21:34:40,080 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 4170 transitions. Word has length 59 [2019-12-18 21:34:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:40,081 INFO L462 AbstractCegarLoop]: Abstraction has 1473 states and 4170 transitions. [2019-12-18 21:34:40,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:34:40,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 4170 transitions. [2019-12-18 21:34:40,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:34:40,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:40,084 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-18 21:34:40,085 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:40,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:40,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1795474320, now seen corresponding path program 2 times [2019-12-18 21:34:40,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:40,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627926766] [2019-12-18 21:34:40,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:40,239 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-18 21:34:40,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627926766] [2019-12-18 21:34:40,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:40,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:34:40,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157075331] [2019-12-18 21:34:40,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:34:40,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:40,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:34:40,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:34:40,246 INFO L87 Difference]: Start difference. First operand 1473 states and 4170 transitions. Second operand 6 states. [2019-12-18 21:34:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:40,331 INFO L93 Difference]: Finished difference Result 2598 states and 6802 transitions. [2019-12-18 21:34:40,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:34:40,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 21:34:40,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:40,333 INFO L225 Difference]: With dead ends: 2598 [2019-12-18 21:34:40,333 INFO L226 Difference]: Without dead ends: 1473 [2019-12-18 21:34:40,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:34:40,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2019-12-18 21:34:40,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1085. [2019-12-18 21:34:40,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1085 states. [2019-12-18 21:34:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 2710 transitions. [2019-12-18 21:34:40,353 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 2710 transitions. Word has length 59 [2019-12-18 21:34:40,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:40,353 INFO L462 AbstractCegarLoop]: Abstraction has 1085 states and 2710 transitions. [2019-12-18 21:34:40,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:34:40,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 2710 transitions. [2019-12-18 21:34:40,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:34:40,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:40,356 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-18 21:34:40,356 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:40,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:40,357 INFO L82 PathProgramCache]: Analyzing trace with hash 745066166, now seen corresponding path program 3 times [2019-12-18 21:34:40,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:40,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69747569] [2019-12-18 21:34:40,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:40,493 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-18 21:34:40,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69747569] [2019-12-18 21:34:40,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:40,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:34:40,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315363843] [2019-12-18 21:34:40,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:34:40,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:40,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:34:40,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:34:40,495 INFO L87 Difference]: Start difference. First operand 1085 states and 2710 transitions. Second operand 5 states. [2019-12-18 21:34:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:40,542 INFO L93 Difference]: Finished difference Result 1433 states and 3354 transitions. [2019-12-18 21:34:40,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:34:40,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-18 21:34:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:40,544 INFO L225 Difference]: With dead ends: 1433 [2019-12-18 21:34:40,544 INFO L226 Difference]: Without dead ends: 419 [2019-12-18 21:34:40,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:34:40,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-12-18 21:34:40,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2019-12-18 21:34:40,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-12-18 21:34:40,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 772 transitions. [2019-12-18 21:34:40,550 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 772 transitions. Word has length 59 [2019-12-18 21:34:40,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:40,551 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 772 transitions. [2019-12-18 21:34:40,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:34:40,551 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 772 transitions. [2019-12-18 21:34:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:34:40,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:40,552 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-18 21:34:40,552 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:40,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:40,553 INFO L82 PathProgramCache]: Analyzing trace with hash -2094447461, now seen corresponding path program 1 times [2019-12-18 21:34:40,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:40,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816690116] [2019-12-18 21:34:40,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:40,660 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-18 21:34:40,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816690116] [2019-12-18 21:34:40,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:40,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:34:40,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571752611] [2019-12-18 21:34:40,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:34:40,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:40,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:34:40,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:34:40,663 INFO L87 Difference]: Start difference. First operand 419 states and 772 transitions. Second operand 3 states. [2019-12-18 21:34:40,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:40,679 INFO L93 Difference]: Finished difference Result 362 states and 646 transitions. [2019-12-18 21:34:40,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:34:40,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:34:40,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:40,680 INFO L225 Difference]: With dead ends: 362 [2019-12-18 21:34:40,680 INFO L226 Difference]: Without dead ends: 362 [2019-12-18 21:34:40,680 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-18 21:34:40,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-12-18 21:34:40,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2019-12-18 21:34:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-12-18 21:34:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 646 transitions. [2019-12-18 21:34:40,687 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 646 transitions. Word has length 59 [2019-12-18 21:34:40,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:40,688 INFO L462 AbstractCegarLoop]: Abstraction has 362 states and 646 transitions. [2019-12-18 21:34:40,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:34:40,688 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 646 transitions. [2019-12-18 21:34:40,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:34:40,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:40,689 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-18 21:34:40,689 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:40,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:40,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1389529784, now seen corresponding path program 4 times [2019-12-18 21:34:40,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:40,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454937055] [2019-12-18 21:34:40,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:40,793 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-18 21:34:40,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454937055] [2019-12-18 21:34:40,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:40,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:34:40,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440761886] [2019-12-18 21:34:40,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:34:40,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:40,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:34:40,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:34:40,798 INFO L87 Difference]: Start difference. First operand 362 states and 646 transitions. Second operand 3 states. [2019-12-18 21:34:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:40,847 INFO L93 Difference]: Finished difference Result 362 states and 645 transitions. [2019-12-18 21:34:40,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:34:40,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:34:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:40,848 INFO L225 Difference]: With dead ends: 362 [2019-12-18 21:34:40,848 INFO L226 Difference]: Without dead ends: 362 [2019-12-18 21:34:40,849 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-18 21:34:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-12-18 21:34:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 234. [2019-12-18 21:34:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-18 21:34:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 413 transitions. [2019-12-18 21:34:40,853 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 413 transitions. Word has length 59 [2019-12-18 21:34:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:40,853 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 413 transitions. [2019-12-18 21:34:40,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:34:40,854 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 413 transitions. [2019-12-18 21:34:40,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:34:40,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:40,854 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, 1] [2019-12-18 21:34:40,855 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:40,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:40,855 INFO L82 PathProgramCache]: Analyzing trace with hash 91372008, now seen corresponding path program 1 times [2019-12-18 21:34:40,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:40,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559396244] [2019-12-18 21:34:40,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:41,427 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-18 21:34:41,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559396244] [2019-12-18 21:34:41,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:41,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 21:34:41,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191393286] [2019-12-18 21:34:41,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 21:34:41,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:41,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 21:34:41,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:34:41,430 INFO L87 Difference]: Start difference. First operand 234 states and 413 transitions. Second operand 18 states. [2019-12-18 21:34:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:42,497 INFO L93 Difference]: Finished difference Result 568 states and 980 transitions. [2019-12-18 21:34:42,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 21:34:42,498 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2019-12-18 21:34:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:42,499 INFO L225 Difference]: With dead ends: 568 [2019-12-18 21:34:42,499 INFO L226 Difference]: Without dead ends: 538 [2019-12-18 21:34:42,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2019-12-18 21:34:42,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-12-18 21:34:42,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 293. [2019-12-18 21:34:42,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-12-18 21:34:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 510 transitions. [2019-12-18 21:34:42,504 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 510 transitions. Word has length 60 [2019-12-18 21:34:42,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:42,504 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 510 transitions. [2019-12-18 21:34:42,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 21:34:42,504 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 510 transitions. [2019-12-18 21:34:42,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:34:42,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:42,510 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, 1] [2019-12-18 21:34:42,511 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:42,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:42,511 INFO L82 PathProgramCache]: Analyzing trace with hash 253987516, now seen corresponding path program 2 times [2019-12-18 21:34:42,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:42,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133268485] [2019-12-18 21:34:42,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:42,820 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-18 21:34:42,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133268485] [2019-12-18 21:34:42,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:42,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:34:42,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241709124] [2019-12-18 21:34:42,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:34:42,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:42,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:34:42,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:34:42,828 INFO L87 Difference]: Start difference. First operand 293 states and 510 transitions. Second operand 13 states. [2019-12-18 21:34:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:43,368 INFO L93 Difference]: Finished difference Result 449 states and 766 transitions. [2019-12-18 21:34:43,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:34:43,368 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 21:34:43,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:43,369 INFO L225 Difference]: With dead ends: 449 [2019-12-18 21:34:43,369 INFO L226 Difference]: Without dead ends: 419 [2019-12-18 21:34:43,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2019-12-18 21:34:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-12-18 21:34:43,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 330. [2019-12-18 21:34:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-12-18 21:34:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 577 transitions. [2019-12-18 21:34:43,374 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 577 transitions. Word has length 60 [2019-12-18 21:34:43,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:43,374 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 577 transitions. [2019-12-18 21:34:43,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:34:43,374 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 577 transitions. [2019-12-18 21:34:43,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:34:43,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:43,375 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, 1] [2019-12-18 21:34:43,375 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:43,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:43,376 INFO L82 PathProgramCache]: Analyzing trace with hash 2137491580, now seen corresponding path program 3 times [2019-12-18 21:34:43,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:43,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559125271] [2019-12-18 21:34:43,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:43,641 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-18 21:34:43,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559125271] [2019-12-18 21:34:43,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:43,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:34:43,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763744863] [2019-12-18 21:34:43,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 21:34:43,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:43,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 21:34:43,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:34:43,643 INFO L87 Difference]: Start difference. First operand 330 states and 577 transitions. Second operand 14 states. [2019-12-18 21:34:44,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:44,345 INFO L93 Difference]: Finished difference Result 462 states and 785 transitions. [2019-12-18 21:34:44,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:34:44,346 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-18 21:34:44,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:44,347 INFO L225 Difference]: With dead ends: 462 [2019-12-18 21:34:44,347 INFO L226 Difference]: Without dead ends: 432 [2019-12-18 21:34:44,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:34:44,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-18 21:34:44,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 334. [2019-12-18 21:34:44,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-12-18 21:34:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 584 transitions. [2019-12-18 21:34:44,352 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 584 transitions. Word has length 60 [2019-12-18 21:34:44,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:44,352 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 584 transitions. [2019-12-18 21:34:44,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 21:34:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 584 transitions. [2019-12-18 21:34:44,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:34:44,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:44,353 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, 1] [2019-12-18 21:34:44,354 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:44,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:44,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1148639144, now seen corresponding path program 4 times [2019-12-18 21:34:44,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:44,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596597276] [2019-12-18 21:34:44,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:34:44,590 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-18 21:34:44,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596597276] [2019-12-18 21:34:44,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:34:44,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:34:44,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580254632] [2019-12-18 21:34:44,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:34:44,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:34:44,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:34:44,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:34:44,592 INFO L87 Difference]: Start difference. First operand 334 states and 584 transitions. Second operand 13 states. [2019-12-18 21:34:45,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:34:45,120 INFO L93 Difference]: Finished difference Result 450 states and 764 transitions. [2019-12-18 21:34:45,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 21:34:45,121 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 21:34:45,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:34:45,121 INFO L225 Difference]: With dead ends: 450 [2019-12-18 21:34:45,122 INFO L226 Difference]: Without dead ends: 420 [2019-12-18 21:34:45,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2019-12-18 21:34:45,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-12-18 21:34:45,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 342. [2019-12-18 21:34:45,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-12-18 21:34:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 598 transitions. [2019-12-18 21:34:45,127 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 598 transitions. Word has length 60 [2019-12-18 21:34:45,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:34:45,127 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 598 transitions. [2019-12-18 21:34:45,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:34:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 598 transitions. [2019-12-18 21:34:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:34:45,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:34:45,128 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, 1] [2019-12-18 21:34:45,128 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:34:45,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:34:45,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1093452108, now seen corresponding path program 5 times [2019-12-18 21:34:45,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:34:45,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492147733] [2019-12-18 21:34:45,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:34:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:34:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:34:45,232 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:34:45,233 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:34:45,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= v_~z$r_buff0_thd0~0_78 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~weak$$choice0~0_8) (= v_~z$r_buff1_thd2~0_8 0) (= v_~x~0_14 0) (= 0 v_~a~0_8) (= 0 v_~__unbuffered_p3_EBX~0_11) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$w_buff0_used~0_104 0) (= v_~z$mem_tmp~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_8 0) (= v_~z$r_buff1_thd1~0_8 0) (= 0 v_~__unbuffered_p3_EAX~0_11) (= 0 v_~z$r_buff1_thd4~0_15) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1261~0.base_21|) (= 0 |v_ULTIMATE.start_main_~#t1261~0.offset_17|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1261~0.base_21|)) (= 0 v_~weak$$choice2~0_34) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$r_buff1_thd0~0_51) (= 0 v_~__unbuffered_cnt~0_26) (= 0 v_~z$flush_delayed~0_16) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1261~0.base_21| 4)) (= v_~z$r_buff0_thd4~0_26 0) (= v_~z$read_delayed_var~0.offset_5 0) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1261~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1261~0.base_21|) |v_ULTIMATE.start_main_~#t1261~0.offset_17| 0))) (= 0 |v_#NULL.base_6|) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t1261~0.base_21| 1)) (= 0 v_~z$r_buff1_thd3~0_15) (< 0 |v_#StackHeapBarrier_20|) (= v_~z~0_27 0) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~z$w_buff0~0_26) (= v_~y~0_11 0) (= v_~main$tmp_guard1~0_13 0) (= v_~b~0_12 0) (= 0 v_~z$w_buff1_used~0_66))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ULTIMATE.start_main_~#t1263~0.offset=|v_ULTIMATE.start_main_~#t1263~0.offset_18|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_10|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, ULTIMATE.start_main_~#t1262~0.base=|v_ULTIMATE.start_main_~#t1262~0.base_23|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ~a~0=v_~a~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_78, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_~#t1264~0.base=|v_ULTIMATE.start_main_~#t1264~0.base_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_66, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_16|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ULTIMATE.start_main_~#t1264~0.offset=|v_ULTIMATE.start_main_~#t1264~0.offset_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_15, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_13|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_51, ULTIMATE.start_main_~#t1262~0.offset=|v_ULTIMATE.start_main_~#t1262~0.offset_18|, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ~y~0=v_~y~0_11, ULTIMATE.start_main_~#t1263~0.base=|v_ULTIMATE.start_main_~#t1263~0.base_22|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ULTIMATE.start_main_~#t1261~0.base=|v_ULTIMATE.start_main_~#t1261~0.base_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_15, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_11, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~b~0=v_~b~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ULTIMATE.start_main_~#t1261~0.offset=|v_ULTIMATE.start_main_~#t1261~0.offset_17|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1263~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1262~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1264~0.base, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1264~0.offset, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1262~0.offset, ULTIMATE.start_main_#t~nondet26, ~y~0, ULTIMATE.start_main_~#t1263~0.base, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1261~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t1261~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:34:45,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L831-1-->L833: Formula: (and (= |v_ULTIMATE.start_main_~#t1262~0.offset_11| 0) (= (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1262~0.base_13| 1) |v_#valid_44|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1262~0.base_13|) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1262~0.base_13|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1262~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1262~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1262~0.base_13|) |v_ULTIMATE.start_main_~#t1262~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1262~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1262~0.base=|v_ULTIMATE.start_main_~#t1262~0.base_13|, ULTIMATE.start_main_~#t1262~0.offset=|v_ULTIMATE.start_main_~#t1262~0.offset_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_21|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1262~0.base, ULTIMATE.start_main_~#t1262~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 21:34:45,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L833-1-->L835: Formula: (and (= |v_ULTIMATE.start_main_~#t1263~0.offset_10| 0) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1263~0.base_11| 1) |v_#valid_40|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1263~0.base_11| 4)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1263~0.base_11|) 0) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1263~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1263~0.base_11|) |v_ULTIMATE.start_main_~#t1263~0.offset_10| 2))) (not (= |v_ULTIMATE.start_main_~#t1263~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1263~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1263~0.offset=|v_ULTIMATE.start_main_~#t1263~0.offset_10|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1263~0.base=|v_ULTIMATE.start_main_~#t1263~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1263~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1263~0.base] because there is no mapped edge [2019-12-18 21:34:45,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L835-1-->L837: Formula: (and (= |v_ULTIMATE.start_main_~#t1264~0.offset_11| 0) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1264~0.base_13|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1264~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1264~0.base_13|) |v_ULTIMATE.start_main_~#t1264~0.offset_11| 3)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1264~0.base_13|) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1264~0.base_13| 1) |v_#valid_46|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1264~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1264~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1264~0.base=|v_ULTIMATE.start_main_~#t1264~0.base_13|, ULTIMATE.start_main_~#t1264~0.offset=|v_ULTIMATE.start_main_~#t1264~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1264~0.base, ULTIMATE.start_main_~#t1264~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-18 21:34:45,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L4-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_14 v_~z$r_buff1_thd3~0_10) (= v_~z$r_buff0_thd0~0_61 v_~z$r_buff1_thd0~0_39) (= v_~z$r_buff1_thd1~0_4 v_~z$r_buff0_thd1~0_3) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_5) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff0_thd4~0_17 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_3) (= v_~z$r_buff0_thd4~0_16 1) (= 1 v_~a~0_3)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_61, ~b~0=v_~b~0_5, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_14, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_3} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_61, ~b~0=v_~b~0_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_4, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_14, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_3} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 21:34:45,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x~0_10 1) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~b~0_8) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_10, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:34:45,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 2 v_~x~0_8) (= 1 v_~y~0_5) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~y~0=v_~y~0_5, ~x~0=v_~x~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:34:45,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-96251289 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-96251289 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-96251289 |P3Thread1of1ForFork3_#t~ite11_Out-96251289|)) (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-96251289| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-96251289, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-96251289} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-96251289, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-96251289, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-96251289|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 21:34:45,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L810-->L810-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd4~0_In-197094433 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-197094433 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-197094433 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-197094433 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-197094433 |P3Thread1of1ForFork3_#t~ite12_Out-197094433|)) (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out-197094433|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-197094433, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-197094433, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-197094433, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-197094433} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-197094433, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-197094433, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-197094433, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-197094433, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-197094433|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 21:34:45,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L772-2-->L772-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1435416609 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1435416609 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite3_Out-1435416609| ~z~0_In-1435416609) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite3_Out-1435416609| ~z$w_buff1~0_In-1435416609)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1435416609, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1435416609, ~z$w_buff1~0=~z$w_buff1~0_In-1435416609, ~z~0=~z~0_In-1435416609} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1435416609|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1435416609, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1435416609, ~z$w_buff1~0=~z$w_buff1~0_In-1435416609, ~z~0=~z~0_In-1435416609} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:34:45,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-4-->L773: Formula: (= v_~z~0_17 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 21:34:45,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In618148494 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In618148494 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite5_Out618148494| ~z$w_buff0_used~0_In618148494) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite5_Out618148494| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In618148494, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In618148494} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out618148494|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In618148494, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In618148494} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:34:45,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L774-->L774-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In-1879879284 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1879879284 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1879879284 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1879879284 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-1879879284|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite6_Out-1879879284| ~z$w_buff1_used~0_In-1879879284)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1879879284, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1879879284, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1879879284, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1879879284} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-1879879284|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1879879284, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1879879284, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1879879284, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1879879284} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:34:45,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In905463031 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In905463031 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In905463031 |P2Thread1of1ForFork2_#t~ite7_Out905463031|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite7_Out905463031|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In905463031, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In905463031} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In905463031, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In905463031, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out905463031|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:34:45,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In574046947 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In574046947 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In574046947 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In574046947 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In574046947 |P2Thread1of1ForFork2_#t~ite8_Out574046947|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite8_Out574046947|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In574046947, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In574046947, ~z$w_buff1_used~0=~z$w_buff1_used~0_In574046947, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In574046947} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In574046947, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In574046947, ~z$w_buff1_used~0=~z$w_buff1_used~0_In574046947, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In574046947, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out574046947|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:34:45,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L776-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork2_#t~ite8_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:34:45,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L811-->L812: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1491664668 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1491664668 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out1491664668) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out1491664668 ~z$r_buff0_thd4~0_In1491664668)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1491664668, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1491664668} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1491664668, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1491664668, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1491664668|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 21:34:45,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1610068086 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1610068086 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1610068086 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In1610068086 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out1610068086| ~z$r_buff1_thd4~0_In1610068086) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out1610068086|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1610068086, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1610068086, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1610068086, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1610068086} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1610068086, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1610068086, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1610068086|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1610068086, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1610068086} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 21:34:45,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L812-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19) (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_13)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_13, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 21:34:45,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-18 21:34:45,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L843-2-->L843-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite20_Out-1455253038| |ULTIMATE.start_main_#t~ite19_Out-1455253038|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1455253038 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1455253038 256)))) (or (and (= ~z~0_In-1455253038 |ULTIMATE.start_main_#t~ite19_Out-1455253038|) .cse0 (or .cse1 .cse2)) (and (= ~z$w_buff1~0_In-1455253038 |ULTIMATE.start_main_#t~ite19_Out-1455253038|) .cse0 (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1455253038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1455253038, ~z$w_buff1~0=~z$w_buff1~0_In-1455253038, ~z~0=~z~0_In-1455253038} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1455253038|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1455253038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1455253038, ~z$w_buff1~0=~z$w_buff1~0_In-1455253038, ~z~0=~z~0_In-1455253038, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1455253038|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:34:45,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In565524983 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In565524983 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out565524983| ~z$w_buff0_used~0_In565524983) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out565524983| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In565524983, ~z$w_buff0_used~0=~z$w_buff0_used~0_In565524983} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In565524983, ~z$w_buff0_used~0=~z$w_buff0_used~0_In565524983, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out565524983|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:34:45,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L845-->L845-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In86286858 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In86286858 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In86286858 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In86286858 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out86286858| ~z$w_buff1_used~0_In86286858) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite22_Out86286858| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In86286858, ~z$w_buff0_used~0=~z$w_buff0_used~0_In86286858, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In86286858, ~z$w_buff1_used~0=~z$w_buff1_used~0_In86286858} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In86286858, ~z$w_buff0_used~0=~z$w_buff0_used~0_In86286858, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In86286858, ~z$w_buff1_used~0=~z$w_buff1_used~0_In86286858, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out86286858|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:34:45,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In727773372 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In727773372 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In727773372 |ULTIMATE.start_main_#t~ite23_Out727773372|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite23_Out727773372|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In727773372, ~z$w_buff0_used~0=~z$w_buff0_used~0_In727773372} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In727773372, ~z$w_buff0_used~0=~z$w_buff0_used~0_In727773372, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out727773372|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:34:45,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L847-->L847-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-1966729816 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1966729816 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1966729816 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1966729816 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite24_Out-1966729816| ~z$r_buff1_thd0~0_In-1966729816)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite24_Out-1966729816| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1966729816, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1966729816, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1966729816, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1966729816} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1966729816, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1966729816, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1966729816, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1966729816|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1966729816} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 21:34:45,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L855-->L855-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In698568332 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite30_In698568332| |ULTIMATE.start_main_#t~ite30_Out698568332|) (= ~z$w_buff0~0_In698568332 |ULTIMATE.start_main_#t~ite31_Out698568332|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite30_Out698568332| ~z$w_buff0~0_In698568332) .cse0 (= |ULTIMATE.start_main_#t~ite30_Out698568332| |ULTIMATE.start_main_#t~ite31_Out698568332|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In698568332 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In698568332 256)) (and (= (mod ~z$r_buff1_thd0~0_In698568332 256) 0) .cse1) (and .cse1 (= (mod ~z$w_buff1_used~0_In698568332 256) 0))))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In698568332, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_In698568332|, ~z$w_buff0~0=~z$w_buff0~0_In698568332, ~z$w_buff0_used~0=~z$w_buff0_used~0_In698568332, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In698568332, ~z$w_buff1_used~0=~z$w_buff1_used~0_In698568332, ~weak$$choice2~0=~weak$$choice2~0_In698568332} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In698568332, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out698568332|, ~z$w_buff0~0=~z$w_buff0~0_In698568332, ~z$w_buff0_used~0=~z$w_buff0_used~0_In698568332, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In698568332, ~z$w_buff1_used~0=~z$w_buff1_used~0_In698568332, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out698568332|, ~weak$$choice2~0=~weak$$choice2~0_In698568332} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2019-12-18 21:34:45,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L856-->L856-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In162593046 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite33_Out162593046| ~z$w_buff1~0_In162593046) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In162593046 256)))) (or (and (= 0 (mod ~z$r_buff1_thd0~0_In162593046 256)) .cse1) (= (mod ~z$w_buff0_used~0_In162593046 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In162593046 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite34_Out162593046| |ULTIMATE.start_main_#t~ite33_Out162593046|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite33_In162593046| |ULTIMATE.start_main_#t~ite33_Out162593046|) (= |ULTIMATE.start_main_#t~ite34_Out162593046| ~z$w_buff1~0_In162593046)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In162593046, ~z$w_buff0_used~0=~z$w_buff0_used~0_In162593046, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In162593046, ~z$w_buff1_used~0=~z$w_buff1_used~0_In162593046, ~z$w_buff1~0=~z$w_buff1~0_In162593046, ~weak$$choice2~0=~weak$$choice2~0_In162593046, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In162593046|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In162593046, ~z$w_buff0_used~0=~z$w_buff0_used~0_In162593046, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In162593046, ~z$w_buff1_used~0=~z$w_buff1_used~0_In162593046, ~z$w_buff1~0=~z$w_buff1~0_In162593046, ~weak$$choice2~0=~weak$$choice2~0_In162593046, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out162593046|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out162593046|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 21:34:45,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L859-->L860: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~z$r_buff0_thd0~0_59 v_~z$r_buff0_thd0~0_58)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_58, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:34:45,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In460041737 256) 0))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In460041737 256) 0))) (or (= (mod ~z$w_buff0_used~0_In460041737 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In460041737 256)) .cse0) (and (= 0 (mod ~z$r_buff1_thd0~0_In460041737 256)) .cse0))) .cse1 (= |ULTIMATE.start_main_#t~ite46_Out460041737| |ULTIMATE.start_main_#t~ite45_Out460041737|) (= ~z$r_buff1_thd0~0_In460041737 |ULTIMATE.start_main_#t~ite45_Out460041737|)) (and (= |ULTIMATE.start_main_#t~ite45_In460041737| |ULTIMATE.start_main_#t~ite45_Out460041737|) (= ~z$r_buff1_thd0~0_In460041737 |ULTIMATE.start_main_#t~ite46_Out460041737|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In460041737, ~z$w_buff0_used~0=~z$w_buff0_used~0_In460041737, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In460041737, ~z$w_buff1_used~0=~z$w_buff1_used~0_In460041737, ~weak$$choice2~0=~weak$$choice2~0_In460041737, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In460041737|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In460041737, ~z$w_buff0_used~0=~z$w_buff0_used~0_In460041737, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In460041737, ~z$w_buff1_used~0=~z$w_buff1_used~0_In460041737, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out460041737|, ~weak$$choice2~0=~weak$$choice2~0_In460041737, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out460041737|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:34:45,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L862-->L4: Formula: (and (= v_~z~0_20 v_~z$mem_tmp~0_6) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_20, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:34:45,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:34:45,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:34:45 BasicIcfg [2019-12-18 21:34:45,364 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:34:45,366 INFO L168 Benchmark]: Toolchain (without parser) took 32734.79 ms. Allocated memory was 138.9 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 101.6 MB in the beginning and 703.8 MB in the end (delta: -602.2 MB). Peak memory consumption was 551.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:34:45,366 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 138.9 MB. Free memory is still 121.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 21:34:45,367 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.00 ms. Allocated memory was 138.9 MB in the beginning and 200.8 MB in the end (delta: 61.9 MB). Free memory was 101.4 MB in the beginning and 153.8 MB in the end (delta: -52.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:34:45,367 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.67 ms. Allocated memory is still 200.8 MB. Free memory was 153.8 MB in the beginning and 151.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:34:45,368 INFO L168 Benchmark]: Boogie Preprocessor took 42.57 ms. Allocated memory is still 200.8 MB. Free memory was 151.2 MB in the beginning and 148.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:34:45,368 INFO L168 Benchmark]: RCFGBuilder took 884.19 ms. Allocated memory is still 200.8 MB. Free memory was 148.6 MB in the beginning and 99.1 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:34:45,369 INFO L168 Benchmark]: TraceAbstraction took 30973.71 ms. Allocated memory was 200.8 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 99.1 MB in the beginning and 703.8 MB in the end (delta: -604.6 MB). Peak memory consumption was 486.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:34:45,372 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.76 ms. Allocated memory is still 138.9 MB. Free memory is still 121.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 745.00 ms. Allocated memory was 138.9 MB in the beginning and 200.8 MB in the end (delta: 61.9 MB). Free memory was 101.4 MB in the beginning and 153.8 MB in the end (delta: -52.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.67 ms. Allocated memory is still 200.8 MB. Free memory was 153.8 MB in the beginning and 151.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.57 ms. Allocated memory is still 200.8 MB. Free memory was 151.2 MB in the beginning and 148.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 884.19 ms. Allocated memory is still 200.8 MB. Free memory was 148.6 MB in the beginning and 99.1 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30973.71 ms. Allocated memory was 200.8 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 99.1 MB in the beginning and 703.8 MB in the end (delta: -604.6 MB). Peak memory consumption was 486.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 180 ProgramPointsBefore, 92 ProgramPointsAfterwards, 208 TransitionsBefore, 99 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 4932 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 52826 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1261, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] FCALL, FORK 0 pthread_create(&t1262, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1263, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1264, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 4 z$w_buff1 = z$w_buff0 [L787] 4 z$w_buff0 = 2 [L788] 4 z$w_buff1_used = z$w_buff0_used [L789] 4 z$w_buff0_used = (_Bool)1 [L808] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 2 [L769] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L772] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L773] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L810] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L851] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L852] 0 z$flush_delayed = weak$$choice2 [L853] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L855] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L856] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L857] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 30.6s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2173 SDtfs, 2489 SDslu, 6858 SDs, 0 SdLazy, 4302 SolverSat, 234 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 40 SyntacticMatches, 18 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50002occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 10141 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 986 NumberOfCodeBlocks, 986 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 906 ConstructedInterpolants, 0 QuantifiedInterpolants, 217930 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...