/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/mix042_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:24:22,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:24:22,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:24:22,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:24:22,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:24:22,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:24:22,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:24:22,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:24:22,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:24:22,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:24:22,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:24:22,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:24:22,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:24:22,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:24:22,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:24:22,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:24:22,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:24:22,452 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:24:22,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:24:22,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:24:22,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:24:22,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:24:22,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:24:22,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:24:22,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:24:22,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:24:22,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:24:22,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:24:22,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:24:22,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:24:22,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:24:22,480 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:24:22,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:24:22,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:24:22,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:24:22,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:24:22,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:24:22,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:24:22,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:24:22,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:24:22,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:24:22,493 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:24:22,517 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:24:22,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:24:22,520 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:24:22,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:24:22,520 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:24:22,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:24:22,521 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:24:22,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:24:22,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:24:22,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:24:22,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:24:22,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:24:22,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:24:22,523 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:24:22,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:24:22,524 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:24:22,524 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:24:22,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:24:22,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:24:22,525 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:24:22,525 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:24:22,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:24:22,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:24:22,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:24:22,526 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:24:22,526 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:24:22,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:24:22,526 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:24:22,526 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:24:22,527 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:24:22,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:24:22,837 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:24:22,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:24:22,844 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:24:22,844 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:24:22,845 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2019-12-18 21:24:22,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c5d2104e/2dfc831befe9416c94d503d88ce43699/FLAGe5b3ed1fd [2019-12-18 21:24:23,512 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:24:23,513 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2019-12-18 21:24:23,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c5d2104e/2dfc831befe9416c94d503d88ce43699/FLAGe5b3ed1fd [2019-12-18 21:24:23,821 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c5d2104e/2dfc831befe9416c94d503d88ce43699 [2019-12-18 21:24:23,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:24:23,832 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:24:23,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:24:23,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:24:23,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:24:23,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:24:23" (1/1) ... [2019-12-18 21:24:23,842 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:24:23, skipping insertion in model container [2019-12-18 21:24:23,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:24:23" (1/1) ... [2019-12-18 21:24:23,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:24:23,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:24:24,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:24:24,454 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:24:24,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:24:24,595 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:24:24,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:24 WrapperNode [2019-12-18 21:24:24,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:24:24,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:24:24,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:24:24,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:24:24,606 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:24:24" (1/1) ... [2019-12-18 21:24:24,626 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:24:24" (1/1) ... [2019-12-18 21:24:24,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:24:24,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:24:24,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:24:24,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:24:24,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:24" (1/1) ... [2019-12-18 21:24:24,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:24" (1/1) ... [2019-12-18 21:24:24,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:24" (1/1) ... [2019-12-18 21:24:24,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:24" (1/1) ... [2019-12-18 21:24:24,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:24" (1/1) ... [2019-12-18 21:24:24,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:24" (1/1) ... [2019-12-18 21:24:24,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:24" (1/1) ... [2019-12-18 21:24:24,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:24:24,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:24:24,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:24:24,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:24:24,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:24" (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:24:24,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:24:24,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:24:24,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:24:24,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:24:24,792 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:24:24,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:24:24,792 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:24:24,793 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:24:24,793 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:24:24,793 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:24:24,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:24:24,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:24:24,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:24:24,795 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:24:25,567 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:24:25,567 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:24:25,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:24:25 BoogieIcfgContainer [2019-12-18 21:24:25,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:24:25,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:24:25,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:24:25,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:24:25,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:24:23" (1/3) ... [2019-12-18 21:24:25,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73345288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:24:25, skipping insertion in model container [2019-12-18 21:24:25,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:24" (2/3) ... [2019-12-18 21:24:25,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73345288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:24:25, skipping insertion in model container [2019-12-18 21:24:25,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:24:25" (3/3) ... [2019-12-18 21:24:25,578 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_power.opt.i [2019-12-18 21:24:25,588 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:24:25,588 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:24:25,596 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:24:25,597 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:24:25,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,634 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,635 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,636 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,636 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,645 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,645 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,645 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,646 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,646 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,657 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,657 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,663 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,664 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,665 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,668 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,669 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:25,684 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:24:25,705 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:24:25,705 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:24:25,705 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:24:25,705 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:24:25,706 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:24:25,706 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:24:25,706 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:24:25,706 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:24:25,724 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-18 21:24:25,727 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 21:24:25,843 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 21:24:25,843 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:24:25,858 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:24:25,878 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 21:24:25,937 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 21:24:25,938 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:24:25,947 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:24:25,965 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 21:24:25,967 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:24:29,506 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 21:24:29,641 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 21:24:29,655 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50879 [2019-12-18 21:24:29,655 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 21:24:29,659 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 85 transitions [2019-12-18 21:24:30,490 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-18 21:24:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-18 21:24:30,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 21:24:30,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:30,499 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:30,500 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:30,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:30,505 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-18 21:24:30,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:30,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299703395] [2019-12-18 21:24:30,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:30,740 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:24:30,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299703395] [2019-12-18 21:24:30,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:30,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:24:30,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001697807] [2019-12-18 21:24:30,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:24:30,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:30,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:24:30,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:24:30,772 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-18 21:24:31,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:31,262 INFO L93 Difference]: Finished difference Result 14182 states and 52796 transitions. [2019-12-18 21:24:31,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:24:31,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 21:24:31,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:31,433 INFO L225 Difference]: With dead ends: 14182 [2019-12-18 21:24:31,433 INFO L226 Difference]: Without dead ends: 13870 [2019-12-18 21:24:31,435 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:24:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-18 21:24:32,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-18 21:24:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-18 21:24:32,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 51678 transitions. [2019-12-18 21:24:32,720 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 51678 transitions. Word has length 7 [2019-12-18 21:24:32,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:32,722 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 51678 transitions. [2019-12-18 21:24:32,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:24:32,722 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 51678 transitions. [2019-12-18 21:24:32,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:24:32,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:32,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:32,733 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:32,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:32,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-18 21:24:32,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:32,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710096094] [2019-12-18 21:24:32,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:32,895 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:24:32,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710096094] [2019-12-18 21:24:32,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:32,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:24:32,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663793101] [2019-12-18 21:24:32,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:24:32,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:32,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:24:32,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:24:32,901 INFO L87 Difference]: Start difference. First operand 13870 states and 51678 transitions. Second operand 4 states. [2019-12-18 21:24:33,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:33,458 INFO L93 Difference]: Finished difference Result 19034 states and 68884 transitions. [2019-12-18 21:24:33,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:24:33,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 21:24:33,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:33,548 INFO L225 Difference]: With dead ends: 19034 [2019-12-18 21:24:33,549 INFO L226 Difference]: Without dead ends: 19034 [2019-12-18 21:24:33,552 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:24:33,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-18 21:24:34,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-18 21:24:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-18 21:24:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68123 transitions. [2019-12-18 21:24:34,488 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68123 transitions. Word has length 13 [2019-12-18 21:24:34,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:34,489 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68123 transitions. [2019-12-18 21:24:34,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:24:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68123 transitions. [2019-12-18 21:24:34,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:24:34,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:34,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:34,493 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:34,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:34,493 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-18 21:24:34,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:34,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404953775] [2019-12-18 21:24:34,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:34,601 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:24:34,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404953775] [2019-12-18 21:24:34,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:34,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:24:34,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197115045] [2019-12-18 21:24:34,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:24:34,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:34,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:24:34,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:24:34,605 INFO L87 Difference]: Start difference. First operand 18800 states and 68123 transitions. Second operand 4 states. [2019-12-18 21:24:35,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:35,143 INFO L93 Difference]: Finished difference Result 27022 states and 95920 transitions. [2019-12-18 21:24:35,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:24:35,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 21:24:35,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:35,253 INFO L225 Difference]: With dead ends: 27022 [2019-12-18 21:24:35,253 INFO L226 Difference]: Without dead ends: 27008 [2019-12-18 21:24:35,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:24:35,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-18 21:24:36,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22014. [2019-12-18 21:24:36,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22014 states. [2019-12-18 21:24:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22014 states to 22014 states and 79478 transitions. [2019-12-18 21:24:37,037 INFO L78 Accepts]: Start accepts. Automaton has 22014 states and 79478 transitions. Word has length 13 [2019-12-18 21:24:37,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:37,037 INFO L462 AbstractCegarLoop]: Abstraction has 22014 states and 79478 transitions. [2019-12-18 21:24:37,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:24:37,037 INFO L276 IsEmpty]: Start isEmpty. Operand 22014 states and 79478 transitions. [2019-12-18 21:24:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 21:24:37,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:37,044 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:37,045 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:37,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:37,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-18 21:24:37,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:37,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262406729] [2019-12-18 21:24:37,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:37,114 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:24:37,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262406729] [2019-12-18 21:24:37,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:37,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:24:37,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182635295] [2019-12-18 21:24:37,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:24:37,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:37,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:24:37,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:24:37,117 INFO L87 Difference]: Start difference. First operand 22014 states and 79478 transitions. Second operand 4 states. [2019-12-18 21:24:37,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:37,195 INFO L93 Difference]: Finished difference Result 12999 states and 40414 transitions. [2019-12-18 21:24:37,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:24:37,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 21:24:37,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:37,224 INFO L225 Difference]: With dead ends: 12999 [2019-12-18 21:24:37,225 INFO L226 Difference]: Without dead ends: 12469 [2019-12-18 21:24:37,225 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:24:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12469 states. [2019-12-18 21:24:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12469 to 12469. [2019-12-18 21:24:37,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12469 states. [2019-12-18 21:24:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12469 states to 12469 states and 38908 transitions. [2019-12-18 21:24:37,773 INFO L78 Accepts]: Start accepts. Automaton has 12469 states and 38908 transitions. Word has length 19 [2019-12-18 21:24:37,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:37,773 INFO L462 AbstractCegarLoop]: Abstraction has 12469 states and 38908 transitions. [2019-12-18 21:24:37,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:24:37,774 INFO L276 IsEmpty]: Start isEmpty. Operand 12469 states and 38908 transitions. [2019-12-18 21:24:37,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 21:24:37,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:37,778 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] [2019-12-18 21:24:37,778 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:37,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:37,778 INFO L82 PathProgramCache]: Analyzing trace with hash -21144877, now seen corresponding path program 1 times [2019-12-18 21:24:37,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:37,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203179159] [2019-12-18 21:24:37,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:37,839 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:24:37,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203179159] [2019-12-18 21:24:37,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:37,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:24:37,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972053145] [2019-12-18 21:24:37,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:24:37,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:37,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:24:37,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:24:37,842 INFO L87 Difference]: Start difference. First operand 12469 states and 38908 transitions. Second operand 5 states. [2019-12-18 21:24:38,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:38,256 INFO L93 Difference]: Finished difference Result 16753 states and 51118 transitions. [2019-12-18 21:24:38,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:24:38,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-18 21:24:38,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:38,287 INFO L225 Difference]: With dead ends: 16753 [2019-12-18 21:24:38,288 INFO L226 Difference]: Without dead ends: 16746 [2019-12-18 21:24:38,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:24:38,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16746 states. [2019-12-18 21:24:38,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16746 to 12620. [2019-12-18 21:24:38,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12620 states. [2019-12-18 21:24:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12620 states to 12620 states and 39274 transitions. [2019-12-18 21:24:38,633 INFO L78 Accepts]: Start accepts. Automaton has 12620 states and 39274 transitions. Word has length 20 [2019-12-18 21:24:38,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:38,633 INFO L462 AbstractCegarLoop]: Abstraction has 12620 states and 39274 transitions. [2019-12-18 21:24:38,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:24:38,634 INFO L276 IsEmpty]: Start isEmpty. Operand 12620 states and 39274 transitions. [2019-12-18 21:24:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 21:24:38,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:38,651 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:38,651 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:38,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:38,652 INFO L82 PathProgramCache]: Analyzing trace with hash -173751725, now seen corresponding path program 1 times [2019-12-18 21:24:38,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:38,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49815888] [2019-12-18 21:24:38,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:38,735 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:24:38,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49815888] [2019-12-18 21:24:38,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:38,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:24:38,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411650070] [2019-12-18 21:24:38,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:24:38,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:38,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:24:38,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:24:38,738 INFO L87 Difference]: Start difference. First operand 12620 states and 39274 transitions. Second operand 5 states. [2019-12-18 21:24:38,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:38,803 INFO L93 Difference]: Finished difference Result 2320 states and 5449 transitions. [2019-12-18 21:24:38,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:24:38,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 21:24:38,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:38,807 INFO L225 Difference]: With dead ends: 2320 [2019-12-18 21:24:38,807 INFO L226 Difference]: Without dead ends: 2011 [2019-12-18 21:24:38,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:24:38,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2019-12-18 21:24:38,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 2011. [2019-12-18 21:24:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2011 states. [2019-12-18 21:24:38,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 4588 transitions. [2019-12-18 21:24:38,851 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 4588 transitions. Word has length 28 [2019-12-18 21:24:38,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:38,852 INFO L462 AbstractCegarLoop]: Abstraction has 2011 states and 4588 transitions. [2019-12-18 21:24:38,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:24:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 4588 transitions. [2019-12-18 21:24:38,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 21:24:38,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:38,857 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] [2019-12-18 21:24:38,857 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:38,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:38,857 INFO L82 PathProgramCache]: Analyzing trace with hash 2015633809, now seen corresponding path program 1 times [2019-12-18 21:24:38,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:38,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913801789] [2019-12-18 21:24:38,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:39,173 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:24:39,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913801789] [2019-12-18 21:24:39,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:39,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:24:39,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635772232] [2019-12-18 21:24:39,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:24:39,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:39,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:24:39,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:24:39,178 INFO L87 Difference]: Start difference. First operand 2011 states and 4588 transitions. Second operand 7 states. [2019-12-18 21:24:39,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:39,703 INFO L93 Difference]: Finished difference Result 2494 states and 5538 transitions. [2019-12-18 21:24:39,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 21:24:39,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-18 21:24:39,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:39,707 INFO L225 Difference]: With dead ends: 2494 [2019-12-18 21:24:39,707 INFO L226 Difference]: Without dead ends: 2492 [2019-12-18 21:24:39,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:24:39,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2019-12-18 21:24:39,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2176. [2019-12-18 21:24:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-12-18 21:24:39,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 4919 transitions. [2019-12-18 21:24:39,751 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 4919 transitions. Word has length 40 [2019-12-18 21:24:39,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:39,751 INFO L462 AbstractCegarLoop]: Abstraction has 2176 states and 4919 transitions. [2019-12-18 21:24:39,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:24:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 4919 transitions. [2019-12-18 21:24:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:24:39,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:39,759 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] [2019-12-18 21:24:39,759 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:39,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:39,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1051815953, now seen corresponding path program 1 times [2019-12-18 21:24:39,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:39,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920301651] [2019-12-18 21:24:39,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:39,864 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:24:39,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920301651] [2019-12-18 21:24:39,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:39,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:24:39,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81121129] [2019-12-18 21:24:39,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:24:39,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:39,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:24:39,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:24:39,867 INFO L87 Difference]: Start difference. First operand 2176 states and 4919 transitions. Second operand 3 states. [2019-12-18 21:24:39,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:39,927 INFO L93 Difference]: Finished difference Result 2619 states and 5916 transitions. [2019-12-18 21:24:39,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:24:39,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 21:24:39,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:39,935 INFO L225 Difference]: With dead ends: 2619 [2019-12-18 21:24:39,936 INFO L226 Difference]: Without dead ends: 2619 [2019-12-18 21:24:39,937 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:24:39,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2619 states. [2019-12-18 21:24:39,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2619 to 2367. [2019-12-18 21:24:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2019-12-18 21:24:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 5412 transitions. [2019-12-18 21:24:40,002 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 5412 transitions. Word has length 44 [2019-12-18 21:24:40,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:40,003 INFO L462 AbstractCegarLoop]: Abstraction has 2367 states and 5412 transitions. [2019-12-18 21:24:40,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:24:40,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 5412 transitions. [2019-12-18 21:24:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:24:40,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:40,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] [2019-12-18 21:24:40,011 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:40,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:40,012 INFO L82 PathProgramCache]: Analyzing trace with hash 517881523, now seen corresponding path program 1 times [2019-12-18 21:24:40,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:40,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634916082] [2019-12-18 21:24:40,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:40,168 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:24:40,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634916082] [2019-12-18 21:24:40,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:40,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:24:40,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055720327] [2019-12-18 21:24:40,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:24:40,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:40,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:24:40,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:24:40,175 INFO L87 Difference]: Start difference. First operand 2367 states and 5412 transitions. Second operand 5 states. [2019-12-18 21:24:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:40,667 INFO L93 Difference]: Finished difference Result 3212 states and 7242 transitions. [2019-12-18 21:24:40,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:24:40,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-18 21:24:40,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:40,672 INFO L225 Difference]: With dead ends: 3212 [2019-12-18 21:24:40,672 INFO L226 Difference]: Without dead ends: 3212 [2019-12-18 21:24:40,672 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:24:40,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2019-12-18 21:24:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 2933. [2019-12-18 21:24:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2933 states. [2019-12-18 21:24:40,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2933 states and 6685 transitions. [2019-12-18 21:24:40,723 INFO L78 Accepts]: Start accepts. Automaton has 2933 states and 6685 transitions. Word has length 44 [2019-12-18 21:24:40,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:40,724 INFO L462 AbstractCegarLoop]: Abstraction has 2933 states and 6685 transitions. [2019-12-18 21:24:40,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:24:40,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 6685 transitions. [2019-12-18 21:24:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 21:24:40,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:40,733 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] [2019-12-18 21:24:40,733 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:40,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:40,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1551487306, now seen corresponding path program 1 times [2019-12-18 21:24:40,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:40,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801900249] [2019-12-18 21:24:40,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:40,880 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:24:40,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801900249] [2019-12-18 21:24:40,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:40,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:24:40,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018283598] [2019-12-18 21:24:40,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:24:40,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:40,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:24:40,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:24:40,885 INFO L87 Difference]: Start difference. First operand 2933 states and 6685 transitions. Second operand 6 states. [2019-12-18 21:24:40,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:40,973 INFO L93 Difference]: Finished difference Result 997 states and 2269 transitions. [2019-12-18 21:24:40,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:24:40,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-18 21:24:40,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:40,977 INFO L225 Difference]: With dead ends: 997 [2019-12-18 21:24:40,978 INFO L226 Difference]: Without dead ends: 927 [2019-12-18 21:24:40,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:24:40,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-12-18 21:24:40,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 797. [2019-12-18 21:24:40,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-12-18 21:24:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1828 transitions. [2019-12-18 21:24:40,991 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1828 transitions. Word has length 45 [2019-12-18 21:24:40,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:40,994 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1828 transitions. [2019-12-18 21:24:40,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:24:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1828 transitions. [2019-12-18 21:24:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:24:40,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:40,997 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] [2019-12-18 21:24:40,997 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:40,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:40,998 INFO L82 PathProgramCache]: Analyzing trace with hash -442739356, now seen corresponding path program 1 times [2019-12-18 21:24:40,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:40,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944024836] [2019-12-18 21:24:40,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:41,137 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:24:41,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944024836] [2019-12-18 21:24:41,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:41,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:24:41,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718595402] [2019-12-18 21:24:41,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:24:41,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:41,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:24:41,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:24:41,140 INFO L87 Difference]: Start difference. First operand 797 states and 1828 transitions. Second operand 3 states. [2019-12-18 21:24:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:41,156 INFO L93 Difference]: Finished difference Result 797 states and 1798 transitions. [2019-12-18 21:24:41,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:24:41,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:24:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:41,158 INFO L225 Difference]: With dead ends: 797 [2019-12-18 21:24:41,158 INFO L226 Difference]: Without dead ends: 797 [2019-12-18 21:24:41,158 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:24:41,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-12-18 21:24:41,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 773. [2019-12-18 21:24:41,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-18 21:24:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1742 transitions. [2019-12-18 21:24:41,170 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1742 transitions. Word has length 55 [2019-12-18 21:24:41,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:41,170 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1742 transitions. [2019-12-18 21:24:41,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:24:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1742 transitions. [2019-12-18 21:24:41,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:24:41,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:41,176 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] [2019-12-18 21:24:41,176 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:41,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:41,176 INFO L82 PathProgramCache]: Analyzing trace with hash 2116087477, now seen corresponding path program 1 times [2019-12-18 21:24:41,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:41,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577611943] [2019-12-18 21:24:41,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:41,310 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:24:41,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577611943] [2019-12-18 21:24:41,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:41,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:24:41,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474674803] [2019-12-18 21:24:41,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:24:41,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:41,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:24:41,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:24:41,312 INFO L87 Difference]: Start difference. First operand 773 states and 1742 transitions. Second operand 6 states. [2019-12-18 21:24:41,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:41,607 INFO L93 Difference]: Finished difference Result 1056 states and 2387 transitions. [2019-12-18 21:24:41,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:24:41,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-18 21:24:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:41,609 INFO L225 Difference]: With dead ends: 1056 [2019-12-18 21:24:41,609 INFO L226 Difference]: Without dead ends: 1056 [2019-12-18 21:24:41,609 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:24:41,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-12-18 21:24:41,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 859. [2019-12-18 21:24:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-12-18 21:24:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1943 transitions. [2019-12-18 21:24:41,621 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1943 transitions. Word has length 56 [2019-12-18 21:24:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:41,622 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1943 transitions. [2019-12-18 21:24:41,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:24:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1943 transitions. [2019-12-18 21:24:41,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:24:41,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:41,624 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] [2019-12-18 21:24:41,625 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:41,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:41,625 INFO L82 PathProgramCache]: Analyzing trace with hash 2084977387, now seen corresponding path program 2 times [2019-12-18 21:24:41,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:41,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609197414] [2019-12-18 21:24:41,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:41,696 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:24:41,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609197414] [2019-12-18 21:24:41,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:41,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:24:41,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266370021] [2019-12-18 21:24:41,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:24:41,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:41,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:24:41,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:24:41,698 INFO L87 Difference]: Start difference. First operand 859 states and 1943 transitions. Second operand 3 states. [2019-12-18 21:24:41,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:41,735 INFO L93 Difference]: Finished difference Result 859 states and 1942 transitions. [2019-12-18 21:24:41,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:24:41,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 21:24:41,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:41,737 INFO L225 Difference]: With dead ends: 859 [2019-12-18 21:24:41,737 INFO L226 Difference]: Without dead ends: 859 [2019-12-18 21:24:41,738 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:24:41,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-12-18 21:24:41,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 604. [2019-12-18 21:24:41,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-18 21:24:41,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1351 transitions. [2019-12-18 21:24:41,747 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1351 transitions. Word has length 56 [2019-12-18 21:24:41,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:41,747 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1351 transitions. [2019-12-18 21:24:41,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:24:41,748 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1351 transitions. [2019-12-18 21:24:41,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:24:41,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:41,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:41,750 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:41,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:41,750 INFO L82 PathProgramCache]: Analyzing trace with hash 748257012, now seen corresponding path program 1 times [2019-12-18 21:24:41,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:41,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538534479] [2019-12-18 21:24:41,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:42,050 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:24:42,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538534479] [2019-12-18 21:24:42,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:42,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:24:42,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717698101] [2019-12-18 21:24:42,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:24:42,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:42,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:24:42,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:24:42,053 INFO L87 Difference]: Start difference. First operand 604 states and 1351 transitions. Second operand 7 states. [2019-12-18 21:24:42,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:42,168 INFO L93 Difference]: Finished difference Result 956 states and 2008 transitions. [2019-12-18 21:24:42,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:24:42,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 21:24:42,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:42,169 INFO L225 Difference]: With dead ends: 956 [2019-12-18 21:24:42,169 INFO L226 Difference]: Without dead ends: 608 [2019-12-18 21:24:42,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:24:42,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-18 21:24:42,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 542. [2019-12-18 21:24:42,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-12-18 21:24:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1172 transitions. [2019-12-18 21:24:42,180 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1172 transitions. Word has length 57 [2019-12-18 21:24:42,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:42,180 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 1172 transitions. [2019-12-18 21:24:42,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:24:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1172 transitions. [2019-12-18 21:24:42,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:24:42,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:42,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:42,183 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:42,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:42,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1731614154, now seen corresponding path program 2 times [2019-12-18 21:24:42,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:42,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31359034] [2019-12-18 21:24:42,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:42,782 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:24:42,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31359034] [2019-12-18 21:24:42,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:42,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 21:24:42,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180484654] [2019-12-18 21:24:42,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 21:24:42,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:42,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 21:24:42,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:24:42,785 INFO L87 Difference]: Start difference. First operand 542 states and 1172 transitions. Second operand 20 states. [2019-12-18 21:24:44,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:44,565 INFO L93 Difference]: Finished difference Result 1339 states and 2979 transitions. [2019-12-18 21:24:44,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 21:24:44,565 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2019-12-18 21:24:44,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:44,568 INFO L225 Difference]: With dead ends: 1339 [2019-12-18 21:24:44,568 INFO L226 Difference]: Without dead ends: 1309 [2019-12-18 21:24:44,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=316, Invalid=1406, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 21:24:44,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2019-12-18 21:24:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 724. [2019-12-18 21:24:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-12-18 21:24:44,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1572 transitions. [2019-12-18 21:24:44,582 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1572 transitions. Word has length 57 [2019-12-18 21:24:44,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:44,582 INFO L462 AbstractCegarLoop]: Abstraction has 724 states and 1572 transitions. [2019-12-18 21:24:44,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 21:24:44,583 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1572 transitions. [2019-12-18 21:24:44,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:24:44,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:44,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:44,585 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:44,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:44,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1334743882, now seen corresponding path program 3 times [2019-12-18 21:24:44,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:44,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016507218] [2019-12-18 21:24:44,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:45,378 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:24:45,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016507218] [2019-12-18 21:24:45,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:45,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-18 21:24:45,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871314117] [2019-12-18 21:24:45,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 21:24:45,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:45,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 21:24:45,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2019-12-18 21:24:45,381 INFO L87 Difference]: Start difference. First operand 724 states and 1572 transitions. Second operand 22 states. [2019-12-18 21:24:47,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:47,235 INFO L93 Difference]: Finished difference Result 1492 states and 3256 transitions. [2019-12-18 21:24:47,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 21:24:47,236 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2019-12-18 21:24:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:47,238 INFO L225 Difference]: With dead ends: 1492 [2019-12-18 21:24:47,238 INFO L226 Difference]: Without dead ends: 1462 [2019-12-18 21:24:47,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=332, Invalid=1560, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 21:24:47,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2019-12-18 21:24:47,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 770. [2019-12-18 21:24:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-12-18 21:24:47,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1687 transitions. [2019-12-18 21:24:47,251 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1687 transitions. Word has length 57 [2019-12-18 21:24:47,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:47,252 INFO L462 AbstractCegarLoop]: Abstraction has 770 states and 1687 transitions. [2019-12-18 21:24:47,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 21:24:47,252 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1687 transitions. [2019-12-18 21:24:47,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:24:47,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:47,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:47,254 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:47,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:47,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1079353218, now seen corresponding path program 4 times [2019-12-18 21:24:47,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:47,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186135248] [2019-12-18 21:24:47,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:47,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:24:47,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186135248] [2019-12-18 21:24:47,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:47,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 21:24:47,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220195209] [2019-12-18 21:24:47,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:24:47,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:47,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:24:47,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:24:47,594 INFO L87 Difference]: Start difference. First operand 770 states and 1687 transitions. Second operand 15 states. [2019-12-18 21:24:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:48,179 INFO L93 Difference]: Finished difference Result 1216 states and 2659 transitions. [2019-12-18 21:24:48,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 21:24:48,179 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-12-18 21:24:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:48,181 INFO L225 Difference]: With dead ends: 1216 [2019-12-18 21:24:48,181 INFO L226 Difference]: Without dead ends: 1186 [2019-12-18 21:24:48,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2019-12-18 21:24:48,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-12-18 21:24:48,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 784. [2019-12-18 21:24:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-12-18 21:24:48,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1718 transitions. [2019-12-18 21:24:48,193 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1718 transitions. Word has length 57 [2019-12-18 21:24:48,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:48,193 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1718 transitions. [2019-12-18 21:24:48,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:24:48,193 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1718 transitions. [2019-12-18 21:24:48,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:24:48,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:48,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:48,195 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:48,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:48,195 INFO L82 PathProgramCache]: Analyzing trace with hash -778309658, now seen corresponding path program 5 times [2019-12-18 21:24:48,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:48,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563166840] [2019-12-18 21:24:48,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:48,485 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:24:48,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563166840] [2019-12-18 21:24:48,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:48,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 21:24:48,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077698149] [2019-12-18 21:24:48,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:24:48,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:48,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:24:48,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:24:48,491 INFO L87 Difference]: Start difference. First operand 784 states and 1718 transitions. Second operand 15 states. [2019-12-18 21:24:49,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:49,238 INFO L93 Difference]: Finished difference Result 1158 states and 2512 transitions. [2019-12-18 21:24:49,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:24:49,239 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-12-18 21:24:49,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:49,241 INFO L225 Difference]: With dead ends: 1158 [2019-12-18 21:24:49,241 INFO L226 Difference]: Without dead ends: 1128 [2019-12-18 21:24:49,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-18 21:24:49,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2019-12-18 21:24:49,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 780. [2019-12-18 21:24:49,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-12-18 21:24:49,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1708 transitions. [2019-12-18 21:24:49,254 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1708 transitions. Word has length 57 [2019-12-18 21:24:49,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:49,254 INFO L462 AbstractCegarLoop]: Abstraction has 780 states and 1708 transitions. [2019-12-18 21:24:49,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:24:49,254 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1708 transitions. [2019-12-18 21:24:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:24:49,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:49,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:49,256 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:49,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:49,257 INFO L82 PathProgramCache]: Analyzing trace with hash -109693258, now seen corresponding path program 6 times [2019-12-18 21:24:49,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:49,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357989655] [2019-12-18 21:24:49,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:24:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:24:49,365 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:24:49,366 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:24:49,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~y$r_buff1_thd3~0_21) (= v_~main$tmp_guard0~0_10 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~y$w_buff1_used~0_72 0) (= 0 v_~y$w_buff1~0_27) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff0_thd1~0_11 0) (= v_~__unbuffered_p2_EBX~0_10 0) (= v_~a~0_11 0) (= v_~z~0_11 0) (= v_~main$tmp_guard1~0_11 0) (= v_~y$read_delayed~0_8 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1108~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1108~0.base_27|) |v_ULTIMATE.start_main_~#t1108~0.offset_21| 0)) |v_#memory_int_15|) (= v_~y$w_buff0_used~0_108 0) (= 0 v_~x~0_9) (= (store .cse0 |v_ULTIMATE.start_main_~#t1108~0.base_27| 1) |v_#valid_54|) (= 0 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_28 0) (= 0 v_~y$r_buff1_thd2~0_21) (= v_~y$mem_tmp~0_11 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1108~0.base_27| 4)) (= v_~y$r_buff0_thd0~0_85 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (< 0 |v_#StackHeapBarrier_14|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1108~0.base_27|)) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= 0 v_~y$w_buff0~0_27) (= 0 v_~y$read_delayed_var~0.base_8) (= v_~y~0_26 0) (= 0 v_~__unbuffered_cnt~0_18) (= |v_ULTIMATE.start_main_~#t1108~0.offset_21| 0) (= v_~y$r_buff0_thd2~0_22 0) (= 0 |v_#NULL.base_5|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1108~0.base_27|) (= 0 v_~y$flush_delayed~0_16) (= 0 v_~y$r_buff1_thd0~0_53))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ULTIMATE.start_main_~#t1109~0.base=|v_ULTIMATE.start_main_~#t1109~0.base_26|, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_16|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_53, ~x~0=v_~x~0_9, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_16|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ULTIMATE.start_main_~#t1108~0.offset=|v_ULTIMATE.start_main_~#t1108~0.offset_21|, ULTIMATE.start_main_~#t1110~0.base=|v_ULTIMATE.start_main_~#t1110~0.base_21|, ~y$w_buff0~0=v_~y$w_buff0~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ULTIMATE.start_main_~#t1110~0.offset=|v_ULTIMATE.start_main_~#t1110~0.offset_16|, ~y~0=v_~y~0_26, ULTIMATE.start_main_~#t1108~0.base=|v_ULTIMATE.start_main_~#t1108~0.base_27|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_14|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ULTIMATE.start_main_~#t1109~0.offset=|v_ULTIMATE.start_main_~#t1109~0.offset_20|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_72} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t1109~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1108~0.offset, ULTIMATE.start_main_~#t1110~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t1110~0.offset, ~y~0, ULTIMATE.start_main_~#t1108~0.base, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_~#t1109~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:24:49,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1109~0.base_9| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1109~0.base_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1109~0.base_9| 1) |v_#valid_27|) (= |v_ULTIMATE.start_main_~#t1109~0.offset_8| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1109~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1109~0.base_9|) |v_ULTIMATE.start_main_~#t1109~0.offset_8| 1))) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1109~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1109~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1109~0.offset=|v_ULTIMATE.start_main_~#t1109~0.offset_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~#t1109~0.base=|v_ULTIMATE.start_main_~#t1109~0.base_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1109~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1109~0.base, #length] because there is no mapped edge [2019-12-18 21:24:49,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1110~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1110~0.base_10|) |v_ULTIMATE.start_main_~#t1110~0.offset_10| 2)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t1110~0.base_10| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1110~0.base_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1110~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1110~0.offset_10|) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1110~0.base_10|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1110~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1110~0.base=|v_ULTIMATE.start_main_~#t1110~0.base_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1110~0.offset=|v_ULTIMATE.start_main_~#t1110~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1110~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1110~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 21:24:49,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L4-->L789: Formula: (and (not (= P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-248090986 0)) (= 1 ~z~0_Out-248090986) (= ~__unbuffered_p2_EBX~0_Out-248090986 ~a~0_In-248090986) (= ~y$r_buff1_thd0~0_Out-248090986 ~y$r_buff0_thd0~0_In-248090986) (= 1 ~y$r_buff0_thd3~0_Out-248090986) (= ~y$r_buff0_thd1~0_In-248090986 ~y$r_buff1_thd1~0_Out-248090986) (= ~y$r_buff1_thd2~0_Out-248090986 ~y$r_buff0_thd2~0_In-248090986) (= ~__unbuffered_p2_EAX~0_Out-248090986 ~z~0_Out-248090986) (= ~y$r_buff0_thd3~0_In-248090986 ~y$r_buff1_thd3~0_Out-248090986)) InVars {~a~0=~a~0_In-248090986, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-248090986, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-248090986, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-248090986, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-248090986, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-248090986} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out-248090986, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-248090986, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-248090986, ~a~0=~a~0_In-248090986, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-248090986, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-248090986, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-248090986, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-248090986, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-248090986, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-248090986, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out-248090986, ~z~0=~z~0_Out-248090986, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-248090986} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 21:24:49,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_4 |v_P0Thread1of1ForFork2_#in~arg.base_4|) (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= 1 v_~a~0_6) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_5) (= v_P0Thread1of1ForFork2_~arg.offset_4 |v_P0Thread1of1ForFork2_#in~arg.offset_4|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, ~x~0=v_~x~0_5} OutVars{~a~0=v_~a~0_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_4, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_5, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_4} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 21:24:49,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite4_Out603514128| |P1Thread1of1ForFork0_#t~ite3_Out603514128|)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In603514128 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In603514128 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= |P1Thread1of1ForFork0_#t~ite3_Out603514128| ~y$w_buff1~0_In603514128)) (and .cse0 (or .cse2 .cse1) (= |P1Thread1of1ForFork0_#t~ite3_Out603514128| ~y~0_In603514128)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In603514128, ~y$w_buff1~0=~y$w_buff1~0_In603514128, ~y~0=~y~0_In603514128, ~y$w_buff1_used~0=~y$w_buff1_used~0_In603514128} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In603514128, ~y$w_buff1~0=~y$w_buff1~0_In603514128, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out603514128|, ~y~0=~y~0_In603514128, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out603514128|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In603514128} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 21:24:49,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-882846577 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-882846577 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite11_Out-882846577| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-882846577 |P2Thread1of1ForFork1_#t~ite11_Out-882846577|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-882846577, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-882846577} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-882846577, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-882846577|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-882846577} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 21:24:49,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1110952591 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1110952591 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1110952591 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-1110952591 256) 0))) (or (and (= ~y$w_buff1_used~0_In-1110952591 |P2Thread1of1ForFork1_#t~ite12_Out-1110952591|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite12_Out-1110952591|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1110952591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1110952591, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1110952591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1110952591} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1110952591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1110952591, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1110952591, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-1110952591|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1110952591} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 21:24:49,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In476024616 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In476024616 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In476024616 ~y$r_buff0_thd3~0_Out476024616)) (and (= ~y$r_buff0_thd3~0_Out476024616 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In476024616, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In476024616} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out476024616|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In476024616, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out476024616} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 21:24:49,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1792766493 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1792766493 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1792766493 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1792766493 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite14_Out-1792766493| ~y$r_buff1_thd3~0_In-1792766493) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite14_Out-1792766493|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1792766493, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1792766493, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1792766493, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1792766493} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-1792766493|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1792766493, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1792766493, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1792766493, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1792766493} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 21:24:49,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 21:24:49,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1461261522 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1461261522 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite5_Out-1461261522| ~y$w_buff0_used~0_In-1461261522)) (and (= |P1Thread1of1ForFork0_#t~ite5_Out-1461261522| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1461261522, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1461261522} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1461261522, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1461261522, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out-1461261522|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:24:49,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In930712794 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In930712794 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In930712794 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In930712794 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite6_Out930712794| ~y$w_buff1_used~0_In930712794) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite6_Out930712794| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In930712794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In930712794, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In930712794, ~y$w_buff1_used~0=~y$w_buff1_used~0_In930712794} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In930712794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In930712794, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In930712794, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out930712794|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In930712794} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:24:49,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-264998810 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-264998810 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite7_Out-264998810| ~y$r_buff0_thd2~0_In-264998810) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite7_Out-264998810| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-264998810, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-264998810} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-264998810, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-264998810, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out-264998810|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 21:24:49,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-87701396 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-87701396 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-87701396 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-87701396 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite8_Out-87701396|)) (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-87701396 |P1Thread1of1ForFork0_#t~ite8_Out-87701396|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-87701396, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-87701396, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-87701396, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-87701396} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-87701396, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-87701396, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-87701396, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out-87701396|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-87701396} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:24:49,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L758-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd2~0_16) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_7|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 21:24:49,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~y$w_buff0_used~0_89 256)) (= 0 (mod v_~y$r_buff0_thd0~0_67 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:24:49,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite18_Out2004956924| |ULTIMATE.start_main_#t~ite19_Out2004956924|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2004956924 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2004956924 256)))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite18_Out2004956924| ~y~0_In2004956924)) (and .cse0 (= ~y$w_buff1~0_In2004956924 |ULTIMATE.start_main_#t~ite18_Out2004956924|) (not .cse2) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2004956924, ~y~0=~y~0_In2004956924, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2004956924, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2004956924} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2004956924, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out2004956924|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out2004956924|, ~y~0=~y~0_In2004956924, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2004956924, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2004956924} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:24:49,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2136320397 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2136320397 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-2136320397| ~y$w_buff0_used~0_In-2136320397) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out-2136320397|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2136320397, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2136320397} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2136320397, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2136320397, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-2136320397|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:24:49,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In647069897 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In647069897 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In647069897 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In647069897 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out647069897| ~y$w_buff1_used~0_In647069897) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite21_Out647069897| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In647069897, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In647069897, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In647069897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In647069897} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In647069897, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In647069897, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out647069897|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In647069897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In647069897} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:24:49,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-232602318 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-232602318 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite22_Out-232602318| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite22_Out-232602318| ~y$r_buff0_thd0~0_In-232602318) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-232602318, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-232602318} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-232602318, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-232602318, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-232602318|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:24:49,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In644286153 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In644286153 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In644286153 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In644286153 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite23_Out644286153| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite23_Out644286153| ~y$r_buff1_thd0~0_In644286153)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In644286153, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In644286153, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In644286153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In644286153} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In644286153, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In644286153, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In644286153, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out644286153|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In644286153} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:24:49,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L834-->L834-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In864601322 256) 0))) (or (and (= ~y$w_buff0~0_In864601322 |ULTIMATE.start_main_#t~ite29_Out864601322|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In864601322 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In864601322 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In864601322 256) 0)) (= (mod ~y$w_buff0_used~0_In864601322 256) 0))) (= |ULTIMATE.start_main_#t~ite30_Out864601322| |ULTIMATE.start_main_#t~ite29_Out864601322|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite30_Out864601322| ~y$w_buff0~0_In864601322) (= |ULTIMATE.start_main_#t~ite29_In864601322| |ULTIMATE.start_main_#t~ite29_Out864601322|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In864601322, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In864601322|, ~y$w_buff0~0=~y$w_buff0~0_In864601322, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In864601322, ~weak$$choice2~0=~weak$$choice2~0_In864601322, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In864601322, ~y$w_buff1_used~0=~y$w_buff1_used~0_In864601322} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out864601322|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In864601322, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out864601322|, ~y$w_buff0~0=~y$w_buff0~0_In864601322, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In864601322, ~weak$$choice2~0=~weak$$choice2~0_In864601322, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In864601322, ~y$w_buff1_used~0=~y$w_buff1_used~0_In864601322} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 21:24:49,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L836-->L836-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1686763622 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out-1686763622| ~y$w_buff0_used~0_In-1686763622) .cse0 (= |ULTIMATE.start_main_#t~ite36_Out-1686763622| |ULTIMATE.start_main_#t~ite35_Out-1686763622|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1686763622 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1686763622 256))) (= 0 (mod ~y$w_buff0_used~0_In-1686763622 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1686763622 256) 0))))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1686763622| ~y$w_buff0_used~0_In-1686763622) (= |ULTIMATE.start_main_#t~ite35_In-1686763622| |ULTIMATE.start_main_#t~ite35_Out-1686763622|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1686763622, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1686763622, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-1686763622|, ~weak$$choice2~0=~weak$$choice2~0_In-1686763622, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1686763622, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1686763622} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1686763622, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1686763622, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1686763622|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1686763622|, ~weak$$choice2~0=~weak$$choice2~0_In-1686763622, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1686763622, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1686763622} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 21:24:49,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L837-->L837-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In353930741 256)))) (or (and (= ~y$w_buff1_used~0_In353930741 |ULTIMATE.start_main_#t~ite38_Out353930741|) (= |ULTIMATE.start_main_#t~ite39_Out353930741| |ULTIMATE.start_main_#t~ite38_Out353930741|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In353930741 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In353930741 256))) (= (mod ~y$w_buff0_used~0_In353930741 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In353930741 256)))))) (and (= ~y$w_buff1_used~0_In353930741 |ULTIMATE.start_main_#t~ite39_Out353930741|) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In353930741| |ULTIMATE.start_main_#t~ite38_Out353930741|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In353930741, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In353930741, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In353930741|, ~weak$$choice2~0=~weak$$choice2~0_In353930741, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In353930741, ~y$w_buff1_used~0=~y$w_buff1_used~0_In353930741} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In353930741, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out353930741|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In353930741, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out353930741|, ~weak$$choice2~0=~weak$$choice2~0_In353930741, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In353930741, ~y$w_buff1_used~0=~y$w_buff1_used~0_In353930741} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 21:24:49,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (= v_~y$r_buff0_thd0~0_61 v_~y$r_buff0_thd0~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:24:49,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L839-->L839-8: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1457778573 256))) (.cse4 (= (mod ~y$w_buff0_used~0_In-1457778573 256) 0)) (.cse6 (= 0 (mod ~y$r_buff0_thd0~0_In-1457778573 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1457778573 256) 0)) (.cse5 (= |ULTIMATE.start_main_#t~ite45_Out-1457778573| |ULTIMATE.start_main_#t~ite44_Out-1457778573|)) (.cse3 (= 0 (mod ~weak$$choice2~0_In-1457778573 256)))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (or (not .cse2) .cse1) .cse3 (= |ULTIMATE.start_main_#t~ite44_Out-1457778573| |ULTIMATE.start_main_#t~ite43_Out-1457778573|) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1457778573|) (not .cse4) .cse5)) (and (or (and (= ~y$r_buff1_thd0~0_In-1457778573 |ULTIMATE.start_main_#t~ite44_Out-1457778573|) .cse3 (or (and .cse6 .cse0) .cse4 (and .cse6 .cse2)) .cse5) (and (= |ULTIMATE.start_main_#t~ite44_In-1457778573| |ULTIMATE.start_main_#t~ite44_Out-1457778573|) (= |ULTIMATE.start_main_#t~ite45_Out-1457778573| ~y$r_buff1_thd0~0_In-1457778573) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_In-1457778573| |ULTIMATE.start_main_#t~ite43_Out-1457778573|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1457778573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1457778573, ~weak$$choice2~0=~weak$$choice2~0_In-1457778573, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_In-1457778573|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1457778573, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1457778573, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-1457778573|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1457778573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1457778573, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1457778573|, ~weak$$choice2~0=~weak$$choice2~0_In-1457778573, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1457778573, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1457778573|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1457778573|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1457778573} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:24:49,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L841-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_22 v_~y$mem_tmp~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:24:49,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:24:49,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:24:49 BasicIcfg [2019-12-18 21:24:49,482 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:24:49,484 INFO L168 Benchmark]: Toolchain (without parser) took 25652.43 ms. Allocated memory was 138.4 MB in the beginning and 994.6 MB in the end (delta: 856.2 MB). Free memory was 99.7 MB in the beginning and 598.4 MB in the end (delta: -498.7 MB). Peak memory consumption was 357.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:24:49,484 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 138.4 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 21:24:49,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.71 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 99.3 MB in the beginning and 155.5 MB in the end (delta: -56.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:24:49,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.94 ms. Allocated memory is still 201.9 MB. Free memory was 155.5 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:24:49,489 INFO L168 Benchmark]: Boogie Preprocessor took 45.28 ms. Allocated memory is still 201.9 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:24:49,493 INFO L168 Benchmark]: RCFGBuilder took 857.25 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 103.2 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:24:49,494 INFO L168 Benchmark]: TraceAbstraction took 23911.83 ms. Allocated memory was 201.9 MB in the beginning and 994.6 MB in the end (delta: 792.7 MB). Free memory was 102.6 MB in the beginning and 598.4 MB in the end (delta: -495.8 MB). Peak memory consumption was 296.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:24:49,499 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.53 ms. Allocated memory is still 138.4 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 763.71 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 99.3 MB in the beginning and 155.5 MB in the end (delta: -56.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.94 ms. Allocated memory is still 201.9 MB. Free memory was 155.5 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.28 ms. Allocated memory is still 201.9 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 857.25 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 103.2 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23911.83 ms. Allocated memory was 201.9 MB in the beginning and 994.6 MB in the end (delta: 792.7 MB). Free memory was 102.6 MB in the beginning and 598.4 MB in the end (delta: -495.8 MB). Peak memory consumption was 296.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 85 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 4245 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50879 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 23.6s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2071 SDtfs, 2746 SDslu, 6723 SDs, 0 SdLazy, 5639 SolverSat, 290 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 27 SyntacticMatches, 14 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22014occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 12900 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 782 NumberOfCodeBlocks, 782 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 707 ConstructedInterpolants, 0 QuantifiedInterpolants, 187389 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...