/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:05:56,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:05:56,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:05:56,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:05:56,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:05:56,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:05:56,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:05:56,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:05:56,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:05:56,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:05:56,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:05:56,460 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:05:56,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:05:56,463 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:05:56,465 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:05:56,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:05:56,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:05:56,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:05:56,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:05:56,478 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:05:56,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:05:56,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:05:56,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:05:56,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:05:56,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:05:56,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:05:56,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:05:56,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:05:56,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:05:56,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:05:56,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:05:56,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:05:56,493 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:05:56,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:05:56,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:05:56,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:05:56,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:05:56,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:05:56,496 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:05:56,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:05:56,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:05:56,498 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:05:56,511 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:05:56,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:05:56,513 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:05:56,513 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:05:56,513 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:05:56,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:05:56,514 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:05:56,514 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:05:56,514 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:05:56,514 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:05:56,514 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:05:56,515 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:05:56,515 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:05:56,515 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:05:56,515 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:05:56,515 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:05:56,516 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:05:56,516 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:05:56,516 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:05:56,516 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:05:56,516 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:05:56,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:05:56,517 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:05:56,517 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:05:56,517 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:05:56,517 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:05:56,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:05:56,518 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:05:56,518 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:05:56,518 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:05:56,518 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:05:56,518 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:05:56,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:05:56,811 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:05:56,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:05:56,816 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:05:56,817 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:05:56,817 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_rmo.oepc.i [2019-12-27 21:05:56,879 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca07dbb7/e9c09ad971724fd0a7b06324ddf213e1/FLAGc812dfe38 [2019-12-27 21:05:57,430 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:05:57,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_rmo.oepc.i [2019-12-27 21:05:57,457 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca07dbb7/e9c09ad971724fd0a7b06324ddf213e1/FLAGc812dfe38 [2019-12-27 21:05:57,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca07dbb7/e9c09ad971724fd0a7b06324ddf213e1 [2019-12-27 21:05:57,718 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:05:57,719 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:05:57,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:05:57,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:05:57,724 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:05:57,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:05:57" (1/1) ... [2019-12-27 21:05:57,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677b895b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:05:57, skipping insertion in model container [2019-12-27 21:05:57,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:05:57" (1/1) ... [2019-12-27 21:05:57,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:05:57,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:05:58,337 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:05:58,356 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:05:58,464 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:05:58,541 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:05:58,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:05:58 WrapperNode [2019-12-27 21:05:58,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:05:58,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:05:58,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:05:58,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:05:58,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:05:58" (1/1) ... [2019-12-27 21:05:58,574 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:05:58" (1/1) ... [2019-12-27 21:05:58,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:05:58,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:05:58,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:05:58,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:05:58,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:05:58" (1/1) ... [2019-12-27 21:05:58,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:05:58" (1/1) ... [2019-12-27 21:05:58,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:05:58" (1/1) ... [2019-12-27 21:05:58,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:05:58" (1/1) ... [2019-12-27 21:05:58,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:05:58" (1/1) ... [2019-12-27 21:05:58,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:05:58" (1/1) ... [2019-12-27 21:05:58,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:05:58" (1/1) ... [2019-12-27 21:05:58,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:05:58,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:05:58,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:05:58,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:05:58,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:05:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:05:58,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:05:58,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:05:58,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:05:58,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:05:58,737 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:05:58,737 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:05:58,737 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:05:58,737 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:05:58,737 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:05:58,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:05:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:05:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:05:58,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:05:58,740 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:05:59,500 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:05:59,500 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:05:59,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:05:59 BoogieIcfgContainer [2019-12-27 21:05:59,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:05:59,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:05:59,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:05:59,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:05:59,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:05:57" (1/3) ... [2019-12-27 21:05:59,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@542f8448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:05:59, skipping insertion in model container [2019-12-27 21:05:59,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:05:58" (2/3) ... [2019-12-27 21:05:59,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@542f8448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:05:59, skipping insertion in model container [2019-12-27 21:05:59,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:05:59" (3/3) ... [2019-12-27 21:05:59,511 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_rmo.oepc.i [2019-12-27 21:05:59,522 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:05:59,522 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:05:59,530 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:05:59,531 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:05:59,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,574 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,575 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,575 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,576 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,576 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,584 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,585 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,625 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,625 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,654 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,656 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,664 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,665 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,665 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,669 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,672 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:05:59,701 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:05:59,725 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:05:59,726 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:05:59,726 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:05:59,726 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:05:59,726 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:05:59,726 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:05:59,726 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:05:59,726 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:05:59,745 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 21:05:59,747 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 21:05:59,885 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 21:05:59,885 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:05:59,904 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:05:59,928 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 21:06:00,029 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 21:06:00,030 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:06:00,041 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:06:00,065 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 21:06:00,067 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:06:03,684 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 21:06:03,847 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 21:06:03,869 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80962 [2019-12-27 21:06:03,869 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 21:06:03,874 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 21:06:19,269 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-27 21:06:19,271 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-27 21:06:19,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:06:19,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:06:19,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:06:19,280 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:06:19,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:06:19,286 INFO L82 PathProgramCache]: Analyzing trace with hash 916881, now seen corresponding path program 1 times [2019-12-27 21:06:19,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:06:19,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924649690] [2019-12-27 21:06:19,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:06:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:06:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:06:19,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924649690] [2019-12-27 21:06:19,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:06:19,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:06:19,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1457553504] [2019-12-27 21:06:19,497 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:06:19,501 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:06:19,513 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:06:19,514 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:06:19,518 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:06:19,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:06:19,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:06:19,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:06:19,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:06:19,536 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-27 21:06:21,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:06:21,223 INFO L93 Difference]: Finished difference Result 104092 states and 443334 transitions. [2019-12-27 21:06:21,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:06:21,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:06:21,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:06:21,938 INFO L225 Difference]: With dead ends: 104092 [2019-12-27 21:06:21,939 INFO L226 Difference]: Without dead ends: 97696 [2019-12-27 21:06:21,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:06:28,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97696 states. [2019-12-27 21:06:30,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97696 to 97696. [2019-12-27 21:06:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97696 states. [2019-12-27 21:06:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97696 states to 97696 states and 415501 transitions. [2019-12-27 21:06:31,183 INFO L78 Accepts]: Start accepts. Automaton has 97696 states and 415501 transitions. Word has length 3 [2019-12-27 21:06:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:06:31,183 INFO L462 AbstractCegarLoop]: Abstraction has 97696 states and 415501 transitions. [2019-12-27 21:06:31,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:06:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 97696 states and 415501 transitions. [2019-12-27 21:06:31,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:06:31,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:06:31,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:06:31,188 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:06:31,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:06:31,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1566799458, now seen corresponding path program 1 times [2019-12-27 21:06:31,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:06:31,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358760210] [2019-12-27 21:06:31,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:06:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:06:31,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:06:31,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358760210] [2019-12-27 21:06:31,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:06:31,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:06:31,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1368638056] [2019-12-27 21:06:31,294 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:06:31,295 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:06:31,299 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:06:31,299 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:06:31,299 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:06:31,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:06:31,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:06:31,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:06:31,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:06:31,302 INFO L87 Difference]: Start difference. First operand 97696 states and 415501 transitions. Second operand 4 states. [2019-12-27 21:06:36,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:06:36,398 INFO L93 Difference]: Finished difference Result 155904 states and 634680 transitions. [2019-12-27 21:06:36,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:06:36,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:06:36,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:06:37,178 INFO L225 Difference]: With dead ends: 155904 [2019-12-27 21:06:37,179 INFO L226 Difference]: Without dead ends: 155855 [2019-12-27 21:06:37,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:06:44,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155855 states. [2019-12-27 21:06:48,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155855 to 141665. [2019-12-27 21:06:48,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141665 states. [2019-12-27 21:06:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141665 states to 141665 states and 584468 transitions. [2019-12-27 21:06:54,611 INFO L78 Accepts]: Start accepts. Automaton has 141665 states and 584468 transitions. Word has length 11 [2019-12-27 21:06:54,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:06:54,612 INFO L462 AbstractCegarLoop]: Abstraction has 141665 states and 584468 transitions. [2019-12-27 21:06:54,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:06:54,612 INFO L276 IsEmpty]: Start isEmpty. Operand 141665 states and 584468 transitions. [2019-12-27 21:06:54,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:06:54,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:06:54,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:06:54,618 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:06:54,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:06:54,619 INFO L82 PathProgramCache]: Analyzing trace with hash 2120295885, now seen corresponding path program 1 times [2019-12-27 21:06:54,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:06:54,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558008486] [2019-12-27 21:06:54,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:06:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:06:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:06:54,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558008486] [2019-12-27 21:06:54,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:06:54,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:06:54,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1781111585] [2019-12-27 21:06:54,712 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:06:54,713 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:06:54,715 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:06:54,715 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:06:54,715 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:06:54,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:06:54,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:06:54,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:06:54,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:06:54,717 INFO L87 Difference]: Start difference. First operand 141665 states and 584468 transitions. Second operand 3 states. [2019-12-27 21:06:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:06:54,858 INFO L93 Difference]: Finished difference Result 31684 states and 102658 transitions. [2019-12-27 21:06:54,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:06:54,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:06:54,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:06:54,911 INFO L225 Difference]: With dead ends: 31684 [2019-12-27 21:06:54,911 INFO L226 Difference]: Without dead ends: 31684 [2019-12-27 21:06:54,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:06:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31684 states. [2019-12-27 21:06:55,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31684 to 31684. [2019-12-27 21:06:55,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31684 states. [2019-12-27 21:06:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31684 states to 31684 states and 102658 transitions. [2019-12-27 21:06:55,480 INFO L78 Accepts]: Start accepts. Automaton has 31684 states and 102658 transitions. Word has length 13 [2019-12-27 21:06:55,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:06:55,480 INFO L462 AbstractCegarLoop]: Abstraction has 31684 states and 102658 transitions. [2019-12-27 21:06:55,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:06:55,481 INFO L276 IsEmpty]: Start isEmpty. Operand 31684 states and 102658 transitions. [2019-12-27 21:06:55,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:06:55,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:06:55,483 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:06:55,483 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:06:55,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:06:55,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2058055416, now seen corresponding path program 1 times [2019-12-27 21:06:55,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:06:55,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320958866] [2019-12-27 21:06:55,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:06:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:06:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:06:55,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320958866] [2019-12-27 21:06:55,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:06:55,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:06:55,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2109511702] [2019-12-27 21:06:55,582 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:06:55,584 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:06:55,587 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:06:55,587 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:06:55,588 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:06:55,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:06:55,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:06:55,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:06:55,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:06:55,589 INFO L87 Difference]: Start difference. First operand 31684 states and 102658 transitions. Second operand 4 states. [2019-12-27 21:06:55,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:06:55,942 INFO L93 Difference]: Finished difference Result 39269 states and 126736 transitions. [2019-12-27 21:06:55,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:06:55,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 21:06:55,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:06:56,012 INFO L225 Difference]: With dead ends: 39269 [2019-12-27 21:06:56,012 INFO L226 Difference]: Without dead ends: 39269 [2019-12-27 21:06:56,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:06:56,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39269 states. [2019-12-27 21:06:57,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39269 to 35204. [2019-12-27 21:06:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35204 states. [2019-12-27 21:06:57,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35204 states to 35204 states and 113989 transitions. [2019-12-27 21:06:57,511 INFO L78 Accepts]: Start accepts. Automaton has 35204 states and 113989 transitions. Word has length 16 [2019-12-27 21:06:57,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:06:57,512 INFO L462 AbstractCegarLoop]: Abstraction has 35204 states and 113989 transitions. [2019-12-27 21:06:57,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:06:57,512 INFO L276 IsEmpty]: Start isEmpty. Operand 35204 states and 113989 transitions. [2019-12-27 21:06:57,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:06:57,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:06:57,521 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] [2019-12-27 21:06:57,521 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:06:57,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:06:57,522 INFO L82 PathProgramCache]: Analyzing trace with hash -36065168, now seen corresponding path program 1 times [2019-12-27 21:06:57,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:06:57,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784497355] [2019-12-27 21:06:57,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:06:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:06:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:06:57,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784497355] [2019-12-27 21:06:57,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:06:57,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:06:57,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1181299320] [2019-12-27 21:06:57,662 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:06:57,666 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:06:57,674 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 54 transitions. [2019-12-27 21:06:57,674 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:06:57,906 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:06:57,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:06:57,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:06:57,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:06:57,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:06:57,908 INFO L87 Difference]: Start difference. First operand 35204 states and 113989 transitions. Second operand 9 states. [2019-12-27 21:06:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:06:59,607 INFO L93 Difference]: Finished difference Result 79631 states and 256672 transitions. [2019-12-27 21:06:59,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:06:59,608 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 21:06:59,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:06:59,738 INFO L225 Difference]: With dead ends: 79631 [2019-12-27 21:06:59,738 INFO L226 Difference]: Without dead ends: 79631 [2019-12-27 21:06:59,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:07:00,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79631 states. [2019-12-27 21:07:01,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79631 to 35336. [2019-12-27 21:07:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35336 states. [2019-12-27 21:07:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35336 states to 35336 states and 114439 transitions. [2019-12-27 21:07:01,159 INFO L78 Accepts]: Start accepts. Automaton has 35336 states and 114439 transitions. Word has length 22 [2019-12-27 21:07:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:01,159 INFO L462 AbstractCegarLoop]: Abstraction has 35336 states and 114439 transitions. [2019-12-27 21:07:01,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:07:01,159 INFO L276 IsEmpty]: Start isEmpty. Operand 35336 states and 114439 transitions. [2019-12-27 21:07:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:07:01,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:01,167 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] [2019-12-27 21:07:01,167 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:01,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:01,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1330562352, now seen corresponding path program 2 times [2019-12-27 21:07:01,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:01,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967442590] [2019-12-27 21:07:01,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:01,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:01,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967442590] [2019-12-27 21:07:01,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:01,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:07:01,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [784526041] [2019-12-27 21:07:01,252 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:01,256 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:01,266 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 21:07:01,266 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:01,267 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:07:01,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:07:01,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:01,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:07:01,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:07:01,268 INFO L87 Difference]: Start difference. First operand 35336 states and 114439 transitions. Second operand 5 states. [2019-12-27 21:07:01,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:01,993 INFO L93 Difference]: Finished difference Result 51547 states and 163782 transitions. [2019-12-27 21:07:01,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:07:01,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 21:07:01,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:02,126 INFO L225 Difference]: With dead ends: 51547 [2019-12-27 21:07:02,126 INFO L226 Difference]: Without dead ends: 51540 [2019-12-27 21:07:02,127 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-27 21:07:02,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51540 states. [2019-12-27 21:07:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51540 to 34913. [2019-12-27 21:07:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34913 states. [2019-12-27 21:07:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34913 states to 34913 states and 112936 transitions. [2019-12-27 21:07:02,864 INFO L78 Accepts]: Start accepts. Automaton has 34913 states and 112936 transitions. Word has length 22 [2019-12-27 21:07:02,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:02,865 INFO L462 AbstractCegarLoop]: Abstraction has 34913 states and 112936 transitions. [2019-12-27 21:07:02,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:07:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand 34913 states and 112936 transitions. [2019-12-27 21:07:02,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:07:02,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:02,876 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:07:02,876 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:02,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:02,877 INFO L82 PathProgramCache]: Analyzing trace with hash -74237997, now seen corresponding path program 1 times [2019-12-27 21:07:02,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:02,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733457794] [2019-12-27 21:07:02,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:02,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733457794] [2019-12-27 21:07:02,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:02,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:07:02,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [407898867] [2019-12-27 21:07:02,940 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:02,943 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:02,952 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 21:07:02,953 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:02,969 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:07:02,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:07:02,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:02,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:07:02,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:07:02,970 INFO L87 Difference]: Start difference. First operand 34913 states and 112936 transitions. Second operand 5 states. [2019-12-27 21:07:03,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:03,043 INFO L93 Difference]: Finished difference Result 14109 states and 42996 transitions. [2019-12-27 21:07:03,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:07:03,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:07:03,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:03,064 INFO L225 Difference]: With dead ends: 14109 [2019-12-27 21:07:03,064 INFO L226 Difference]: Without dead ends: 14109 [2019-12-27 21:07:03,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:07:03,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14109 states. [2019-12-27 21:07:03,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14109 to 13809. [2019-12-27 21:07:03,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13809 states. [2019-12-27 21:07:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13809 states to 13809 states and 42140 transitions. [2019-12-27 21:07:03,633 INFO L78 Accepts]: Start accepts. Automaton has 13809 states and 42140 transitions. Word has length 25 [2019-12-27 21:07:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:03,633 INFO L462 AbstractCegarLoop]: Abstraction has 13809 states and 42140 transitions. [2019-12-27 21:07:03,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:07:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 13809 states and 42140 transitions. [2019-12-27 21:07:03,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:07:03,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:03,644 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:07:03,644 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:03,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:03,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1416816819, now seen corresponding path program 1 times [2019-12-27 21:07:03,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:03,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089067387] [2019-12-27 21:07:03,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:03,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:03,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089067387] [2019-12-27 21:07:03,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:03,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:07:03,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1821465303] [2019-12-27 21:07:03,681 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:03,686 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:03,692 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:07:03,692 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:03,693 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:07:03,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:07:03,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:03,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:07:03,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:07:03,694 INFO L87 Difference]: Start difference. First operand 13809 states and 42140 transitions. Second operand 3 states. [2019-12-27 21:07:03,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:03,793 INFO L93 Difference]: Finished difference Result 19650 states and 58966 transitions. [2019-12-27 21:07:03,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:07:03,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 21:07:03,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:03,820 INFO L225 Difference]: With dead ends: 19650 [2019-12-27 21:07:03,820 INFO L226 Difference]: Without dead ends: 19650 [2019-12-27 21:07:03,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:07:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19650 states. [2019-12-27 21:07:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19650 to 14555. [2019-12-27 21:07:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14555 states. [2019-12-27 21:07:04,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14555 states to 14555 states and 44278 transitions. [2019-12-27 21:07:04,069 INFO L78 Accepts]: Start accepts. Automaton has 14555 states and 44278 transitions. Word has length 27 [2019-12-27 21:07:04,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:04,069 INFO L462 AbstractCegarLoop]: Abstraction has 14555 states and 44278 transitions. [2019-12-27 21:07:04,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:07:04,069 INFO L276 IsEmpty]: Start isEmpty. Operand 14555 states and 44278 transitions. [2019-12-27 21:07:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:07:04,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:04,079 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:07:04,080 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:04,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:04,080 INFO L82 PathProgramCache]: Analyzing trace with hash -522150304, now seen corresponding path program 1 times [2019-12-27 21:07:04,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:04,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076360269] [2019-12-27 21:07:04,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:04,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076360269] [2019-12-27 21:07:04,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:04,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:07:04,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1959785861] [2019-12-27 21:07:04,167 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:04,173 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:04,179 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:07:04,180 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:04,180 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:07:04,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:07:04,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:04,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:07:04,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:07:04,182 INFO L87 Difference]: Start difference. First operand 14555 states and 44278 transitions. Second operand 6 states. [2019-12-27 21:07:05,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:05,028 INFO L93 Difference]: Finished difference Result 37188 states and 111594 transitions. [2019-12-27 21:07:05,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:07:05,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:07:05,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:05,084 INFO L225 Difference]: With dead ends: 37188 [2019-12-27 21:07:05,084 INFO L226 Difference]: Without dead ends: 37188 [2019-12-27 21:07:05,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:07:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37188 states. [2019-12-27 21:07:05,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37188 to 20478. [2019-12-27 21:07:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-27 21:07:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 63215 transitions. [2019-12-27 21:07:05,508 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 63215 transitions. Word has length 27 [2019-12-27 21:07:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:05,508 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 63215 transitions. [2019-12-27 21:07:05,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:07:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 63215 transitions. [2019-12-27 21:07:05,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 21:07:05,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:05,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:07:05,523 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:05,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:05,523 INFO L82 PathProgramCache]: Analyzing trace with hash -624201971, now seen corresponding path program 1 times [2019-12-27 21:07:05,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:05,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664365484] [2019-12-27 21:07:05,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:05,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:05,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664365484] [2019-12-27 21:07:05,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:05,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:07:05,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [467622674] [2019-12-27 21:07:05,613 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:05,618 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:05,627 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 21:07:05,627 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:05,627 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:07:05,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:07:05,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:05,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:07:05,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:07:05,628 INFO L87 Difference]: Start difference. First operand 20478 states and 63215 transitions. Second operand 6 states. [2019-12-27 21:07:06,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:06,350 INFO L93 Difference]: Finished difference Result 34478 states and 103330 transitions. [2019-12-27 21:07:06,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:07:06,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 21:07:06,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:06,400 INFO L225 Difference]: With dead ends: 34478 [2019-12-27 21:07:06,400 INFO L226 Difference]: Without dead ends: 34478 [2019-12-27 21:07:06,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:07:06,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34478 states. [2019-12-27 21:07:07,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34478 to 20240. [2019-12-27 21:07:07,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20240 states. [2019-12-27 21:07:07,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20240 states to 20240 states and 62600 transitions. [2019-12-27 21:07:07,108 INFO L78 Accepts]: Start accepts. Automaton has 20240 states and 62600 transitions. Word has length 28 [2019-12-27 21:07:07,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:07,108 INFO L462 AbstractCegarLoop]: Abstraction has 20240 states and 62600 transitions. [2019-12-27 21:07:07,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:07:07,109 INFO L276 IsEmpty]: Start isEmpty. Operand 20240 states and 62600 transitions. [2019-12-27 21:07:07,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:07:07,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:07,129 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] [2019-12-27 21:07:07,131 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:07,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:07,131 INFO L82 PathProgramCache]: Analyzing trace with hash -160608776, now seen corresponding path program 1 times [2019-12-27 21:07:07,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:07,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744863820] [2019-12-27 21:07:07,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:07,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744863820] [2019-12-27 21:07:07,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:07,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:07:07,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1352670157] [2019-12-27 21:07:07,250 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:07,255 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:07,269 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 65 transitions. [2019-12-27 21:07:07,269 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:07,459 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:07:07,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:07:07,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:07,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:07:07,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:07:07,461 INFO L87 Difference]: Start difference. First operand 20240 states and 62600 transitions. Second operand 10 states. [2019-12-27 21:07:10,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:10,346 INFO L93 Difference]: Finished difference Result 69823 states and 209190 transitions. [2019-12-27 21:07:10,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 21:07:10,346 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-12-27 21:07:10,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:10,453 INFO L225 Difference]: With dead ends: 69823 [2019-12-27 21:07:10,453 INFO L226 Difference]: Without dead ends: 69823 [2019-12-27 21:07:10,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-12-27 21:07:10,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69823 states. [2019-12-27 21:07:11,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69823 to 21771. [2019-12-27 21:07:11,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21771 states. [2019-12-27 21:07:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21771 states to 21771 states and 67265 transitions. [2019-12-27 21:07:11,519 INFO L78 Accepts]: Start accepts. Automaton has 21771 states and 67265 transitions. Word has length 33 [2019-12-27 21:07:11,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:11,520 INFO L462 AbstractCegarLoop]: Abstraction has 21771 states and 67265 transitions. [2019-12-27 21:07:11,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:07:11,520 INFO L276 IsEmpty]: Start isEmpty. Operand 21771 states and 67265 transitions. [2019-12-27 21:07:11,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:07:11,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:11,544 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] [2019-12-27 21:07:11,544 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:11,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:11,545 INFO L82 PathProgramCache]: Analyzing trace with hash 88321435, now seen corresponding path program 1 times [2019-12-27 21:07:11,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:11,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420790891] [2019-12-27 21:07:11,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:11,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:11,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420790891] [2019-12-27 21:07:11,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:11,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:07:11,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2091902206] [2019-12-27 21:07:11,580 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:11,586 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:11,603 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 71 transitions. [2019-12-27 21:07:11,603 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:11,605 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:07:11,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:07:11,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:11,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:07:11,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:07:11,606 INFO L87 Difference]: Start difference. First operand 21771 states and 67265 transitions. Second operand 3 states. [2019-12-27 21:07:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:11,725 INFO L93 Difference]: Finished difference Result 29013 states and 86739 transitions. [2019-12-27 21:07:11,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:07:11,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 21:07:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:11,765 INFO L225 Difference]: With dead ends: 29013 [2019-12-27 21:07:11,765 INFO L226 Difference]: Without dead ends: 29013 [2019-12-27 21:07:11,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:07:11,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29013 states. [2019-12-27 21:07:12,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29013 to 20501. [2019-12-27 21:07:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20501 states. [2019-12-27 21:07:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20501 states to 20501 states and 61416 transitions. [2019-12-27 21:07:12,114 INFO L78 Accepts]: Start accepts. Automaton has 20501 states and 61416 transitions. Word has length 33 [2019-12-27 21:07:12,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:12,114 INFO L462 AbstractCegarLoop]: Abstraction has 20501 states and 61416 transitions. [2019-12-27 21:07:12,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:07:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 20501 states and 61416 transitions. [2019-12-27 21:07:12,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:07:12,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:12,131 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] [2019-12-27 21:07:12,131 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:12,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:12,131 INFO L82 PathProgramCache]: Analyzing trace with hash 838482894, now seen corresponding path program 2 times [2019-12-27 21:07:12,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:12,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667474150] [2019-12-27 21:07:12,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:12,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:12,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667474150] [2019-12-27 21:07:12,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:12,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:07:12,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [407110838] [2019-12-27 21:07:12,244 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:12,249 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:12,265 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 73 transitions. [2019-12-27 21:07:12,266 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:12,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:07:12,304 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:07:12,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:07:12,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:12,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:07:12,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:07:12,305 INFO L87 Difference]: Start difference. First operand 20501 states and 61416 transitions. Second operand 9 states. [2019-12-27 21:07:15,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:15,286 INFO L93 Difference]: Finished difference Result 62586 states and 182614 transitions. [2019-12-27 21:07:15,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 21:07:15,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 21:07:15,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:15,378 INFO L225 Difference]: With dead ends: 62586 [2019-12-27 21:07:15,378 INFO L226 Difference]: Without dead ends: 62586 [2019-12-27 21:07:15,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=1079, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 21:07:15,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62586 states. [2019-12-27 21:07:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62586 to 23222. [2019-12-27 21:07:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23222 states. [2019-12-27 21:07:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23222 states to 23222 states and 69697 transitions. [2019-12-27 21:07:16,396 INFO L78 Accepts]: Start accepts. Automaton has 23222 states and 69697 transitions. Word has length 33 [2019-12-27 21:07:16,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:16,396 INFO L462 AbstractCegarLoop]: Abstraction has 23222 states and 69697 transitions. [2019-12-27 21:07:16,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:07:16,396 INFO L276 IsEmpty]: Start isEmpty. Operand 23222 states and 69697 transitions. [2019-12-27 21:07:16,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:07:16,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:16,420 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] [2019-12-27 21:07:16,420 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:16,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:16,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1993650805, now seen corresponding path program 1 times [2019-12-27 21:07:16,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:16,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605382417] [2019-12-27 21:07:16,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:16,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605382417] [2019-12-27 21:07:16,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:16,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:07:16,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1319331749] [2019-12-27 21:07:16,501 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:16,508 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:16,524 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 66 transitions. [2019-12-27 21:07:16,524 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:16,695 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:07:16,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:07:16,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:16,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:07:16,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:07:16,697 INFO L87 Difference]: Start difference. First operand 23222 states and 69697 transitions. Second operand 10 states. [2019-12-27 21:07:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:19,291 INFO L93 Difference]: Finished difference Result 53461 states and 158997 transitions. [2019-12-27 21:07:19,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 21:07:19,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-27 21:07:19,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:19,373 INFO L225 Difference]: With dead ends: 53461 [2019-12-27 21:07:19,373 INFO L226 Difference]: Without dead ends: 53461 [2019-12-27 21:07:19,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-12-27 21:07:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53461 states. [2019-12-27 21:07:19,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53461 to 22086. [2019-12-27 21:07:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22086 states. [2019-12-27 21:07:19,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22086 states to 22086 states and 66380 transitions. [2019-12-27 21:07:19,929 INFO L78 Accepts]: Start accepts. Automaton has 22086 states and 66380 transitions. Word has length 34 [2019-12-27 21:07:19,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:19,929 INFO L462 AbstractCegarLoop]: Abstraction has 22086 states and 66380 transitions. [2019-12-27 21:07:19,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:07:19,929 INFO L276 IsEmpty]: Start isEmpty. Operand 22086 states and 66380 transitions. [2019-12-27 21:07:19,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:07:19,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:19,951 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] [2019-12-27 21:07:19,951 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:19,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:19,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1065822653, now seen corresponding path program 2 times [2019-12-27 21:07:19,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:19,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934220549] [2019-12-27 21:07:19,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:20,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934220549] [2019-12-27 21:07:20,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:20,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:07:20,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [575249718] [2019-12-27 21:07:20,109 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:20,116 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:20,127 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 56 transitions. [2019-12-27 21:07:20,128 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:20,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:07:20,147 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:07:20,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:07:20,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:20,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:07:20,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:07:20,148 INFO L87 Difference]: Start difference. First operand 22086 states and 66380 transitions. Second operand 10 states. [2019-12-27 21:07:20,920 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-12-27 21:07:23,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:23,825 INFO L93 Difference]: Finished difference Result 51405 states and 149838 transitions. [2019-12-27 21:07:23,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 21:07:23,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-27 21:07:23,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:23,900 INFO L225 Difference]: With dead ends: 51405 [2019-12-27 21:07:23,900 INFO L226 Difference]: Without dead ends: 51405 [2019-12-27 21:07:23,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=311, Invalid=1249, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 21:07:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51405 states. [2019-12-27 21:07:24,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51405 to 21395. [2019-12-27 21:07:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21395 states. [2019-12-27 21:07:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21395 states to 21395 states and 64377 transitions. [2019-12-27 21:07:24,425 INFO L78 Accepts]: Start accepts. Automaton has 21395 states and 64377 transitions. Word has length 34 [2019-12-27 21:07:24,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:24,425 INFO L462 AbstractCegarLoop]: Abstraction has 21395 states and 64377 transitions. [2019-12-27 21:07:24,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:07:24,425 INFO L276 IsEmpty]: Start isEmpty. Operand 21395 states and 64377 transitions. [2019-12-27 21:07:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 21:07:24,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:24,454 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] [2019-12-27 21:07:24,455 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:24,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:24,455 INFO L82 PathProgramCache]: Analyzing trace with hash -565888573, now seen corresponding path program 1 times [2019-12-27 21:07:24,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:24,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309044841] [2019-12-27 21:07:24,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:24,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:24,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309044841] [2019-12-27 21:07:24,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:24,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:07:24,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1369791164] [2019-12-27 21:07:24,685 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:24,693 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:24,717 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 102 transitions. [2019-12-27 21:07:24,717 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:24,738 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:07:24,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:07:24,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:24,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:07:24,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:07:24,739 INFO L87 Difference]: Start difference. First operand 21395 states and 64377 transitions. Second operand 9 states. [2019-12-27 21:07:26,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:26,639 INFO L93 Difference]: Finished difference Result 46149 states and 135038 transitions. [2019-12-27 21:07:26,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 21:07:26,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-27 21:07:26,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:26,733 INFO L225 Difference]: With dead ends: 46149 [2019-12-27 21:07:26,734 INFO L226 Difference]: Without dead ends: 46149 [2019-12-27 21:07:26,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-12-27 21:07:26,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46149 states. [2019-12-27 21:07:27,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46149 to 20291. [2019-12-27 21:07:27,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20291 states. [2019-12-27 21:07:27,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20291 states to 20291 states and 61060 transitions. [2019-12-27 21:07:27,541 INFO L78 Accepts]: Start accepts. Automaton has 20291 states and 61060 transitions. Word has length 38 [2019-12-27 21:07:27,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:27,541 INFO L462 AbstractCegarLoop]: Abstraction has 20291 states and 61060 transitions. [2019-12-27 21:07:27,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:07:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 20291 states and 61060 transitions. [2019-12-27 21:07:27,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:07:27,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:27,560 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] [2019-12-27 21:07:27,560 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:27,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:27,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2067431116, now seen corresponding path program 1 times [2019-12-27 21:07:27,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:27,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910261779] [2019-12-27 21:07:27,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:27,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910261779] [2019-12-27 21:07:27,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:27,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:07:27,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [213178317] [2019-12-27 21:07:27,606 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:27,614 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:27,687 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 382 transitions. [2019-12-27 21:07:27,687 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:27,740 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:07:27,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:07:27,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:27,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:07:27,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:07:27,741 INFO L87 Difference]: Start difference. First operand 20291 states and 61060 transitions. Second operand 6 states. [2019-12-27 21:07:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:28,179 INFO L93 Difference]: Finished difference Result 39550 states and 119485 transitions. [2019-12-27 21:07:28,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:07:28,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-27 21:07:28,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:28,213 INFO L225 Difference]: With dead ends: 39550 [2019-12-27 21:07:28,213 INFO L226 Difference]: Without dead ends: 22293 [2019-12-27 21:07:28,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:07:28,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22293 states. [2019-12-27 21:07:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22293 to 18727. [2019-12-27 21:07:28,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18727 states. [2019-12-27 21:07:28,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18727 states to 18727 states and 55258 transitions. [2019-12-27 21:07:28,515 INFO L78 Accepts]: Start accepts. Automaton has 18727 states and 55258 transitions. Word has length 39 [2019-12-27 21:07:28,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:28,516 INFO L462 AbstractCegarLoop]: Abstraction has 18727 states and 55258 transitions. [2019-12-27 21:07:28,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:07:28,516 INFO L276 IsEmpty]: Start isEmpty. Operand 18727 states and 55258 transitions. [2019-12-27 21:07:28,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:07:28,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:28,532 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] [2019-12-27 21:07:28,533 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:28,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:28,533 INFO L82 PathProgramCache]: Analyzing trace with hash -757785660, now seen corresponding path program 2 times [2019-12-27 21:07:28,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:28,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039754059] [2019-12-27 21:07:28,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:28,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:28,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039754059] [2019-12-27 21:07:28,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:28,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:07:28,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [825907571] [2019-12-27 21:07:28,578 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:28,595 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:28,662 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 379 transitions. [2019-12-27 21:07:28,663 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:28,664 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:07:28,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:07:28,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:28,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:07:28,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:07:28,668 INFO L87 Difference]: Start difference. First operand 18727 states and 55258 transitions. Second operand 3 states. [2019-12-27 21:07:28,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:28,742 INFO L93 Difference]: Finished difference Result 18726 states and 55256 transitions. [2019-12-27 21:07:28,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:07:28,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 21:07:28,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:28,775 INFO L225 Difference]: With dead ends: 18726 [2019-12-27 21:07:28,775 INFO L226 Difference]: Without dead ends: 18726 [2019-12-27 21:07:28,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:07:28,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18726 states. [2019-12-27 21:07:29,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18726 to 18726. [2019-12-27 21:07:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18726 states. [2019-12-27 21:07:29,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18726 states to 18726 states and 55256 transitions. [2019-12-27 21:07:29,051 INFO L78 Accepts]: Start accepts. Automaton has 18726 states and 55256 transitions. Word has length 39 [2019-12-27 21:07:29,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:29,051 INFO L462 AbstractCegarLoop]: Abstraction has 18726 states and 55256 transitions. [2019-12-27 21:07:29,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:07:29,052 INFO L276 IsEmpty]: Start isEmpty. Operand 18726 states and 55256 transitions. [2019-12-27 21:07:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 21:07:29,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:29,068 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-27 21:07:29,069 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:29,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:29,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2102980145, now seen corresponding path program 1 times [2019-12-27 21:07:29,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:29,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223779847] [2019-12-27 21:07:29,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:29,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:29,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223779847] [2019-12-27 21:07:29,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:29,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:07:29,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [437858398] [2019-12-27 21:07:29,120 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:29,128 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:29,160 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 128 transitions. [2019-12-27 21:07:29,160 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:29,162 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:07:29,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:07:29,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:29,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:07:29,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:07:29,163 INFO L87 Difference]: Start difference. First operand 18726 states and 55256 transitions. Second operand 4 states. [2019-12-27 21:07:29,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:29,282 INFO L93 Difference]: Finished difference Result 33720 states and 99537 transitions. [2019-12-27 21:07:29,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:07:29,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 21:07:29,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:29,306 INFO L225 Difference]: With dead ends: 33720 [2019-12-27 21:07:29,306 INFO L226 Difference]: Without dead ends: 16454 [2019-12-27 21:07:29,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:07:29,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2019-12-27 21:07:29,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 16452. [2019-12-27 21:07:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16452 states. [2019-12-27 21:07:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16452 states to 16452 states and 47912 transitions. [2019-12-27 21:07:29,874 INFO L78 Accepts]: Start accepts. Automaton has 16452 states and 47912 transitions. Word has length 40 [2019-12-27 21:07:29,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:29,874 INFO L462 AbstractCegarLoop]: Abstraction has 16452 states and 47912 transitions. [2019-12-27 21:07:29,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:07:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 16452 states and 47912 transitions. [2019-12-27 21:07:29,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 21:07:29,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:29,888 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-27 21:07:29,888 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:29,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:29,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1539619421, now seen corresponding path program 2 times [2019-12-27 21:07:29,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:29,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265125994] [2019-12-27 21:07:29,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:29,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265125994] [2019-12-27 21:07:29,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:29,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:07:29,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [350208083] [2019-12-27 21:07:29,941 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:29,949 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:30,047 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 454 transitions. [2019-12-27 21:07:30,048 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:30,078 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:07:30,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:07:30,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:30,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:07:30,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:07:30,080 INFO L87 Difference]: Start difference. First operand 16452 states and 47912 transitions. Second operand 7 states. [2019-12-27 21:07:30,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:30,190 INFO L93 Difference]: Finished difference Result 15230 states and 45133 transitions. [2019-12-27 21:07:30,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:07:30,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 21:07:30,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:30,222 INFO L225 Difference]: With dead ends: 15230 [2019-12-27 21:07:30,222 INFO L226 Difference]: Without dead ends: 12991 [2019-12-27 21:07:30,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:07:30,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12991 states. [2019-12-27 21:07:30,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12991 to 12459. [2019-12-27 21:07:30,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12459 states. [2019-12-27 21:07:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12459 states to 12459 states and 38681 transitions. [2019-12-27 21:07:30,632 INFO L78 Accepts]: Start accepts. Automaton has 12459 states and 38681 transitions. Word has length 40 [2019-12-27 21:07:30,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:30,633 INFO L462 AbstractCegarLoop]: Abstraction has 12459 states and 38681 transitions. [2019-12-27 21:07:30,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:07:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand 12459 states and 38681 transitions. [2019-12-27 21:07:30,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:07:30,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:30,659 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:07:30,659 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:30,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:30,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1729634848, now seen corresponding path program 1 times [2019-12-27 21:07:30,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:30,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335954675] [2019-12-27 21:07:30,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:30,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335954675] [2019-12-27 21:07:30,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:30,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:07:30,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1626658200] [2019-12-27 21:07:30,860 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:30,884 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:31,261 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 265 states and 518 transitions. [2019-12-27 21:07:31,261 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:31,534 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 21:07:31,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:07:31,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:31,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:07:31,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:07:31,536 INFO L87 Difference]: Start difference. First operand 12459 states and 38681 transitions. Second operand 11 states. [2019-12-27 21:07:35,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:35,488 INFO L93 Difference]: Finished difference Result 81117 states and 243665 transitions. [2019-12-27 21:07:35,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-27 21:07:35,489 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 21:07:35,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:35,567 INFO L225 Difference]: With dead ends: 81117 [2019-12-27 21:07:35,568 INFO L226 Difference]: Without dead ends: 60820 [2019-12-27 21:07:35,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 29 SyntacticMatches, 14 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=710, Invalid=2830, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 21:07:35,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60820 states. [2019-12-27 21:07:36,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60820 to 14479. [2019-12-27 21:07:36,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14479 states. [2019-12-27 21:07:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14479 states to 14479 states and 44946 transitions. [2019-12-27 21:07:36,073 INFO L78 Accepts]: Start accepts. Automaton has 14479 states and 44946 transitions. Word has length 64 [2019-12-27 21:07:36,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:36,073 INFO L462 AbstractCegarLoop]: Abstraction has 14479 states and 44946 transitions. [2019-12-27 21:07:36,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:07:36,074 INFO L276 IsEmpty]: Start isEmpty. Operand 14479 states and 44946 transitions. [2019-12-27 21:07:36,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:07:36,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:36,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:07:36,090 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:36,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:36,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2099431100, now seen corresponding path program 2 times [2019-12-27 21:07:36,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:36,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834136975] [2019-12-27 21:07:36,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:36,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:36,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834136975] [2019-12-27 21:07:36,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:36,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:07:36,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [594429567] [2019-12-27 21:07:36,177 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:36,197 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:36,439 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 363 transitions. [2019-12-27 21:07:36,439 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:36,498 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:07:36,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:07:36,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:36,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:07:36,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:07:36,499 INFO L87 Difference]: Start difference. First operand 14479 states and 44946 transitions. Second operand 10 states. [2019-12-27 21:07:38,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:38,204 INFO L93 Difference]: Finished difference Result 37535 states and 113060 transitions. [2019-12-27 21:07:38,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:07:38,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 21:07:38,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:38,244 INFO L225 Difference]: With dead ends: 37535 [2019-12-27 21:07:38,244 INFO L226 Difference]: Without dead ends: 27688 [2019-12-27 21:07:38,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-12-27 21:07:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27688 states. [2019-12-27 21:07:38,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27688 to 16372. [2019-12-27 21:07:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16372 states. [2019-12-27 21:07:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16372 states to 16372 states and 50408 transitions. [2019-12-27 21:07:38,580 INFO L78 Accepts]: Start accepts. Automaton has 16372 states and 50408 transitions. Word has length 64 [2019-12-27 21:07:38,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:38,580 INFO L462 AbstractCegarLoop]: Abstraction has 16372 states and 50408 transitions. [2019-12-27 21:07:38,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:07:38,580 INFO L276 IsEmpty]: Start isEmpty. Operand 16372 states and 50408 transitions. [2019-12-27 21:07:38,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:07:38,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:38,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:07:38,598 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:38,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:38,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1686766406, now seen corresponding path program 3 times [2019-12-27 21:07:38,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:38,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230667134] [2019-12-27 21:07:38,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:38,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:38,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230667134] [2019-12-27 21:07:38,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:38,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:07:38,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [417652610] [2019-12-27 21:07:38,676 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:38,695 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:39,237 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 301 states and 588 transitions. [2019-12-27 21:07:39,238 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:39,429 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 21:07:39,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:07:39,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:39,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:07:39,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:07:39,431 INFO L87 Difference]: Start difference. First operand 16372 states and 50408 transitions. Second operand 11 states. [2019-12-27 21:07:41,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:41,189 INFO L93 Difference]: Finished difference Result 33560 states and 102088 transitions. [2019-12-27 21:07:41,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:07:41,190 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 21:07:41,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:41,226 INFO L225 Difference]: With dead ends: 33560 [2019-12-27 21:07:41,226 INFO L226 Difference]: Without dead ends: 25006 [2019-12-27 21:07:41,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:07:41,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25006 states. [2019-12-27 21:07:41,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25006 to 16660. [2019-12-27 21:07:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16660 states. [2019-12-27 21:07:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16660 states to 16660 states and 51260 transitions. [2019-12-27 21:07:41,535 INFO L78 Accepts]: Start accepts. Automaton has 16660 states and 51260 transitions. Word has length 64 [2019-12-27 21:07:41,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:41,535 INFO L462 AbstractCegarLoop]: Abstraction has 16660 states and 51260 transitions. [2019-12-27 21:07:41,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:07:41,535 INFO L276 IsEmpty]: Start isEmpty. Operand 16660 states and 51260 transitions. [2019-12-27 21:07:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:07:41,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:41,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:07:41,553 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:41,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:41,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2033773150, now seen corresponding path program 4 times [2019-12-27 21:07:41,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:41,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092462837] [2019-12-27 21:07:41,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:41,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:41,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092462837] [2019-12-27 21:07:41,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:41,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:07:41,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1600333370] [2019-12-27 21:07:41,618 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:41,636 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:41,832 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 354 transitions. [2019-12-27 21:07:41,832 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:41,833 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:07:41,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:07:41,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:41,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:07:41,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:07:41,834 INFO L87 Difference]: Start difference. First operand 16660 states and 51260 transitions. Second operand 3 states. [2019-12-27 21:07:41,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:41,931 INFO L93 Difference]: Finished difference Result 19217 states and 58990 transitions. [2019-12-27 21:07:41,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:07:41,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 21:07:41,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:41,956 INFO L225 Difference]: With dead ends: 19217 [2019-12-27 21:07:41,957 INFO L226 Difference]: Without dead ends: 19217 [2019-12-27 21:07:41,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:07:42,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19217 states. [2019-12-27 21:07:42,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19217 to 17260. [2019-12-27 21:07:42,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17260 states. [2019-12-27 21:07:42,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17260 states to 17260 states and 53245 transitions. [2019-12-27 21:07:42,237 INFO L78 Accepts]: Start accepts. Automaton has 17260 states and 53245 transitions. Word has length 64 [2019-12-27 21:07:42,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:42,237 INFO L462 AbstractCegarLoop]: Abstraction has 17260 states and 53245 transitions. [2019-12-27 21:07:42,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:07:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 17260 states and 53245 transitions. [2019-12-27 21:07:42,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:07:42,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:42,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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:07:42,256 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:42,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:42,256 INFO L82 PathProgramCache]: Analyzing trace with hash -2130207003, now seen corresponding path program 1 times [2019-12-27 21:07:42,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:42,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892192443] [2019-12-27 21:07:42,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:42,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892192443] [2019-12-27 21:07:42,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:42,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:07:42,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1815796590] [2019-12-27 21:07:42,306 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:42,325 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:42,810 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 415 transitions. [2019-12-27 21:07:42,810 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:42,882 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 21:07:42,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:07:42,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:42,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:07:42,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:07:42,884 INFO L87 Difference]: Start difference. First operand 17260 states and 53245 transitions. Second operand 6 states. [2019-12-27 21:07:43,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:43,486 INFO L93 Difference]: Finished difference Result 32785 states and 100245 transitions. [2019-12-27 21:07:43,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:07:43,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 21:07:43,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:43,534 INFO L225 Difference]: With dead ends: 32785 [2019-12-27 21:07:43,534 INFO L226 Difference]: Without dead ends: 32785 [2019-12-27 21:07:43,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:07:43,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32785 states. [2019-12-27 21:07:43,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32785 to 18249. [2019-12-27 21:07:43,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18249 states. [2019-12-27 21:07:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18249 states to 18249 states and 56208 transitions. [2019-12-27 21:07:43,928 INFO L78 Accepts]: Start accepts. Automaton has 18249 states and 56208 transitions. Word has length 65 [2019-12-27 21:07:43,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:43,929 INFO L462 AbstractCegarLoop]: Abstraction has 18249 states and 56208 transitions. [2019-12-27 21:07:43,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:07:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 18249 states and 56208 transitions. [2019-12-27 21:07:43,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:07:43,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:43,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:07:43,948 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:43,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:43,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1707397215, now seen corresponding path program 2 times [2019-12-27 21:07:43,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:43,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516014734] [2019-12-27 21:07:43,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:44,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:07:44,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516014734] [2019-12-27 21:07:44,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:44,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:07:44,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1925986993] [2019-12-27 21:07:44,050 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:44,071 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:44,407 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 438 transitions. [2019-12-27 21:07:44,407 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:44,629 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:07:44,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:07:44,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:44,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:07:44,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:07:44,631 INFO L87 Difference]: Start difference. First operand 18249 states and 56208 transitions. Second operand 12 states. [2019-12-27 21:07:46,158 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 21:07:46,521 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 21:07:46,999 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 21:07:47,153 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 21:07:47,768 WARN L192 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 21:07:48,266 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 21:07:49,136 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-12-27 21:07:49,303 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 21:07:49,581 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 21:07:49,802 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 21:07:50,027 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 21:07:51,044 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 21:07:51,860 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 21:07:53,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:53,876 INFO L93 Difference]: Finished difference Result 56765 states and 171634 transitions. [2019-12-27 21:07:53,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-12-27 21:07:53,877 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 21:07:53,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:53,948 INFO L225 Difference]: With dead ends: 56765 [2019-12-27 21:07:53,949 INFO L226 Difference]: Without dead ends: 49246 [2019-12-27 21:07:53,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2391 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1103, Invalid=5539, Unknown=0, NotChecked=0, Total=6642 [2019-12-27 21:07:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49246 states. [2019-12-27 21:07:54,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49246 to 18460. [2019-12-27 21:07:54,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18460 states. [2019-12-27 21:07:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18460 states to 18460 states and 56909 transitions. [2019-12-27 21:07:54,456 INFO L78 Accepts]: Start accepts. Automaton has 18460 states and 56909 transitions. Word has length 65 [2019-12-27 21:07:54,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:07:54,456 INFO L462 AbstractCegarLoop]: Abstraction has 18460 states and 56909 transitions. [2019-12-27 21:07:54,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:07:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand 18460 states and 56909 transitions. [2019-12-27 21:07:54,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:07:54,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:07:54,477 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:07:54,477 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:07:54,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:07:54,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1138162659, now seen corresponding path program 3 times [2019-12-27 21:07:54,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:07:54,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238459452] [2019-12-27 21:07:54,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:07:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:07:54,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-27 21:07:54,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238459452] [2019-12-27 21:07:54,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:07:54,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:07:54,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [634214953] [2019-12-27 21:07:54,591 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:07:54,610 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:07:55,180 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 248 states and 469 transitions. [2019-12-27 21:07:55,180 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:07:55,408 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:07:55,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:07:55,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:07:55,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:07:55,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:07:55,409 INFO L87 Difference]: Start difference. First operand 18460 states and 56909 transitions. Second operand 12 states. [2019-12-27 21:07:59,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:07:59,890 INFO L93 Difference]: Finished difference Result 86392 states and 262045 transitions. [2019-12-27 21:07:59,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-27 21:07:59,891 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 21:07:59,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:07:59,988 INFO L225 Difference]: With dead ends: 86392 [2019-12-27 21:07:59,989 INFO L226 Difference]: Without dead ends: 65147 [2019-12-27 21:07:59,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=821, Invalid=3339, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 21:08:00,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65147 states. [2019-12-27 21:08:00,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65147 to 20621. [2019-12-27 21:08:00,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20621 states. [2019-12-27 21:08:00,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20621 states to 20621 states and 63126 transitions. [2019-12-27 21:08:00,644 INFO L78 Accepts]: Start accepts. Automaton has 20621 states and 63126 transitions. Word has length 65 [2019-12-27 21:08:00,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:00,644 INFO L462 AbstractCegarLoop]: Abstraction has 20621 states and 63126 transitions. [2019-12-27 21:08:00,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:08:00,644 INFO L276 IsEmpty]: Start isEmpty. Operand 20621 states and 63126 transitions. [2019-12-27 21:08:00,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:08:00,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:00,669 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:08:00,669 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:00,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:00,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1698966502, now seen corresponding path program 1 times [2019-12-27 21:08:00,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:00,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968170500] [2019-12-27 21:08:00,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:08:00,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968170500] [2019-12-27 21:08:00,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:00,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:08:00,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1001024350] [2019-12-27 21:08:00,737 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:00,754 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:00,918 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 192 states and 334 transitions. [2019-12-27 21:08:00,918 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:00,983 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 21:08:00,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:08:00,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:00,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:08:00,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:08:00,984 INFO L87 Difference]: Start difference. First operand 20621 states and 63126 transitions. Second operand 7 states. [2019-12-27 21:08:01,338 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-27 21:08:02,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:02,355 INFO L93 Difference]: Finished difference Result 32906 states and 98229 transitions. [2019-12-27 21:08:02,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:08:02,355 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 21:08:02,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:02,401 INFO L225 Difference]: With dead ends: 32906 [2019-12-27 21:08:02,401 INFO L226 Difference]: Without dead ends: 32686 [2019-12-27 21:08:02,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:08:02,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32686 states. [2019-12-27 21:08:02,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32686 to 25881. [2019-12-27 21:08:02,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25881 states. [2019-12-27 21:08:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25881 states to 25881 states and 78345 transitions. [2019-12-27 21:08:02,851 INFO L78 Accepts]: Start accepts. Automaton has 25881 states and 78345 transitions. Word has length 65 [2019-12-27 21:08:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:02,851 INFO L462 AbstractCegarLoop]: Abstraction has 25881 states and 78345 transitions. [2019-12-27 21:08:02,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:08:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand 25881 states and 78345 transitions. [2019-12-27 21:08:02,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:08:02,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:02,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:08:02,880 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:02,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:02,880 INFO L82 PathProgramCache]: Analyzing trace with hash -568944948, now seen corresponding path program 2 times [2019-12-27 21:08:02,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:02,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740949152] [2019-12-27 21:08:02,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:08:03,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740949152] [2019-12-27 21:08:03,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:03,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:08:03,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [474328838] [2019-12-27 21:08:03,030 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:03,044 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:03,290 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 199 states and 352 transitions. [2019-12-27 21:08:03,290 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:03,564 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 21:08:03,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:08:03,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:03,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:08:03,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:08:03,566 INFO L87 Difference]: Start difference. First operand 25881 states and 78345 transitions. Second operand 11 states. [2019-12-27 21:08:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:07,437 INFO L93 Difference]: Finished difference Result 57438 states and 170975 transitions. [2019-12-27 21:08:07,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 21:08:07,438 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 21:08:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:07,520 INFO L225 Difference]: With dead ends: 57438 [2019-12-27 21:08:07,520 INFO L226 Difference]: Without dead ends: 57438 [2019-12-27 21:08:07,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-12-27 21:08:07,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57438 states. [2019-12-27 21:08:08,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57438 to 25748. [2019-12-27 21:08:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25748 states. [2019-12-27 21:08:08,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25748 states to 25748 states and 77972 transitions. [2019-12-27 21:08:08,439 INFO L78 Accepts]: Start accepts. Automaton has 25748 states and 77972 transitions. Word has length 65 [2019-12-27 21:08:08,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:08,439 INFO L462 AbstractCegarLoop]: Abstraction has 25748 states and 77972 transitions. [2019-12-27 21:08:08,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:08:08,439 INFO L276 IsEmpty]: Start isEmpty. Operand 25748 states and 77972 transitions. [2019-12-27 21:08:08,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:08:08,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:08,469 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:08:08,470 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:08,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:08,470 INFO L82 PathProgramCache]: Analyzing trace with hash 393402024, now seen corresponding path program 3 times [2019-12-27 21:08:08,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:08,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632224957] [2019-12-27 21:08:08,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:08:08,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632224957] [2019-12-27 21:08:08,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:08,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:08:08,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [388284346] [2019-12-27 21:08:08,528 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:08,541 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:08,877 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 256 states and 473 transitions. [2019-12-27 21:08:08,877 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:08,888 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:08:08,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:08:08,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:08,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:08:08,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:08:08,889 INFO L87 Difference]: Start difference. First operand 25748 states and 77972 transitions. Second operand 4 states. [2019-12-27 21:08:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:09,020 INFO L93 Difference]: Finished difference Result 18093 states and 54321 transitions. [2019-12-27 21:08:09,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:08:09,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 21:08:09,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:09,060 INFO L225 Difference]: With dead ends: 18093 [2019-12-27 21:08:09,061 INFO L226 Difference]: Without dead ends: 18093 [2019-12-27 21:08:09,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:08:09,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18093 states. [2019-12-27 21:08:09,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18093 to 17871. [2019-12-27 21:08:09,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17871 states. [2019-12-27 21:08:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17871 states to 17871 states and 53704 transitions. [2019-12-27 21:08:09,491 INFO L78 Accepts]: Start accepts. Automaton has 17871 states and 53704 transitions. Word has length 65 [2019-12-27 21:08:09,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:09,491 INFO L462 AbstractCegarLoop]: Abstraction has 17871 states and 53704 transitions. [2019-12-27 21:08:09,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:08:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 17871 states and 53704 transitions. [2019-12-27 21:08:09,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:08:09,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:09,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:08:09,520 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:09,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:09,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1578373453, now seen corresponding path program 1 times [2019-12-27 21:08:09,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:09,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031757318] [2019-12-27 21:08:09,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:08:09,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-27 21:08:09,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031757318] [2019-12-27 21:08:09,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:08:09,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:08:09,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [792792348] [2019-12-27 21:08:09,591 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:08:09,606 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:08:09,923 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 290 states and 571 transitions. [2019-12-27 21:08:09,924 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:08:09,924 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:08:09,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:08:09,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:08:09,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:08:09,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:08:09,925 INFO L87 Difference]: Start difference. First operand 17871 states and 53704 transitions. Second operand 3 states. [2019-12-27 21:08:09,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:08:09,986 INFO L93 Difference]: Finished difference Result 17871 states and 53703 transitions. [2019-12-27 21:08:09,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:08:09,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 21:08:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:08:10,011 INFO L225 Difference]: With dead ends: 17871 [2019-12-27 21:08:10,011 INFO L226 Difference]: Without dead ends: 17871 [2019-12-27 21:08:10,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:08:10,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17871 states. [2019-12-27 21:08:10,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17871 to 15804. [2019-12-27 21:08:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15804 states. [2019-12-27 21:08:10,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15804 states to 15804 states and 47995 transitions. [2019-12-27 21:08:10,414 INFO L78 Accepts]: Start accepts. Automaton has 15804 states and 47995 transitions. Word has length 66 [2019-12-27 21:08:10,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:08:10,414 INFO L462 AbstractCegarLoop]: Abstraction has 15804 states and 47995 transitions. [2019-12-27 21:08:10,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:08:10,414 INFO L276 IsEmpty]: Start isEmpty. Operand 15804 states and 47995 transitions. [2019-12-27 21:08:10,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:08:10,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:08:10,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:08:10,431 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:08:10,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:08:10,431 INFO L82 PathProgramCache]: Analyzing trace with hash -611821270, now seen corresponding path program 1 times [2019-12-27 21:08:10,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:08:10,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087065615] [2019-12-27 21:08:10,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:08:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:08:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:08:10,570 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:08:10,570 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:08:10,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~a$mem_tmp~0_9) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1013~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1013~0.base_23|) |v_ULTIMATE.start_main_~#t1013~0.offset_18| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~a~0_26 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1013~0.base_23|) 0) (= v_~a$r_buff0_thd0~0_20 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~a$r_buff0_thd2~0_19 0) (= |v_#NULL.offset_6| 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$r_buff1_thd1~0_19) (= 0 v_~z~0_6) (< 0 |v_#StackHeapBarrier_19|) (= 0 v_~a$r_buff1_thd3~0_52) (= 0 v_~y~0_7) (= v_~a$r_buff0_thd3~0_77 0) (= v_~a$flush_delayed~0_12 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1013~0.base_23|) (= 0 v_~a$r_buff1_thd0~0_26) (= 0 v_~a$w_buff0~0_23) (= 0 v_~a$w_buff0_used~0_113) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t1013~0.base_23| 1)) (= |v_ULTIMATE.start_main_~#t1013~0.offset_18| 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~a$r_buff0_thd1~0_28 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1013~0.base_23| 4)) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= 0 v_~a$r_buff1_thd2~0_21) (= 0 v_~a$w_buff1~0_25) (= v_~x~0_19 0) (= 0 v_~a$w_buff1_used~0_76))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1014~0.base=|v_ULTIMATE.start_main_~#t1014~0.base_21|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_10|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_20, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_10|, ~a~0=v_~a~0_26, ULTIMATE.start_main_~#t1013~0.offset=|v_ULTIMATE.start_main_~#t1013~0.offset_18|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_23, ULTIMATE.start_main_~#t1015~0.offset=|v_ULTIMATE.start_main_~#t1015~0.offset_16|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_26, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_19, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ULTIMATE.start_main_~#t1014~0.offset=|v_ULTIMATE.start_main_~#t1014~0.offset_15|, ULTIMATE.start_main_~#t1015~0.base=|v_ULTIMATE.start_main_~#t1015~0.base_20|, ~a$mem_tmp~0=v_~a$mem_tmp~0_9, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_10|, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~y~0=v_~y~0_7, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_6, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_76, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t1013~0.base=|v_ULTIMATE.start_main_~#t1013~0.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1014~0.base, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_~#t1013~0.offset, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ULTIMATE.start_main_~#t1015~0.offset, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t1014~0.offset, ULTIMATE.start_main_~#t1015~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t1013~0.base] because there is no mapped edge [2019-12-27 21:08:10,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L830-1-->L832: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1014~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1014~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1014~0.base_9|) |v_ULTIMATE.start_main_~#t1014~0.offset_7| 1)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1014~0.base_9| 4)) (= |v_ULTIMATE.start_main_~#t1014~0.offset_7| 0) (not (= |v_ULTIMATE.start_main_~#t1014~0.base_9| 0)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1014~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1014~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t1014~0.base=|v_ULTIMATE.start_main_~#t1014~0.base_9|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1014~0.offset=|v_ULTIMATE.start_main_~#t1014~0.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1014~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1014~0.offset] because there is no mapped edge [2019-12-27 21:08:10,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L832-1-->L834: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1015~0.base_9| 4) |v_#length_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1015~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1015~0.base_9|) |v_ULTIMATE.start_main_~#t1015~0.offset_8| 2))) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1015~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1015~0.base_9| 0)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1015~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t1015~0.offset_8| 0) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1015~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1015~0.base=|v_ULTIMATE.start_main_~#t1015~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1015~0.offset=|v_ULTIMATE.start_main_~#t1015~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1015~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1015~0.offset, #length] because there is no mapped edge [2019-12-27 21:08:10,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L4-->L748: Formula: (and (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In929745707 0)) (= ~a$r_buff0_thd1~0_Out929745707 1) (= 1 ~x~0_Out929745707) (= ~a$r_buff1_thd3~0_Out929745707 ~a$r_buff0_thd3~0_In929745707) (= ~a$r_buff1_thd2~0_Out929745707 ~a$r_buff0_thd2~0_In929745707) (= ~a$r_buff0_thd0~0_In929745707 ~a$r_buff1_thd0~0_Out929745707) (= ~a$r_buff1_thd1~0_Out929745707 ~a$r_buff0_thd1~0_In929745707)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In929745707, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In929745707, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In929745707, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In929745707, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In929745707} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out929745707, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out929745707, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out929745707, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out929745707, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In929745707, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In929745707, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In929745707, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out929745707, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In929745707, ~x~0=~x~0_Out929745707} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 21:08:10,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out500004059| |P1Thread1of1ForFork2_#t~ite10_Out500004059|)) (.cse2 (= (mod ~a$r_buff1_thd2~0_In500004059 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In500004059 256)))) (or (and (not .cse0) .cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out500004059| ~a$w_buff1~0_In500004059) (not .cse2)) (and .cse1 (or .cse2 .cse0) (= ~a~0_In500004059 |P1Thread1of1ForFork2_#t~ite9_Out500004059|)))) InVars {~a~0=~a~0_In500004059, ~a$w_buff1~0=~a$w_buff1~0_In500004059, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In500004059, ~a$w_buff1_used~0=~a$w_buff1_used~0_In500004059} OutVars{~a~0=~a~0_In500004059, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out500004059|, ~a$w_buff1~0=~a$w_buff1~0_In500004059, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In500004059, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out500004059|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In500004059} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 21:08:10,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L796-->L796-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In903350409 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_Out903350409| ~a$w_buff0~0_In903350409) (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In903350409 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In903350409 256)) (and (= (mod ~a$r_buff1_thd3~0_In903350409 256) 0) .cse0) (and (= (mod ~a$w_buff1_used~0_In903350409 256) 0) .cse0))) .cse1 (= |P2Thread1of1ForFork0_#t~ite21_Out903350409| |P2Thread1of1ForFork0_#t~ite20_Out903350409|)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite21_Out903350409| ~a$w_buff0~0_In903350409) (= |P2Thread1of1ForFork0_#t~ite20_In903350409| |P2Thread1of1ForFork0_#t~ite20_Out903350409|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In903350409, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In903350409, ~a$w_buff0_used~0=~a$w_buff0_used~0_In903350409, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In903350409, ~a$w_buff1_used~0=~a$w_buff1_used~0_In903350409, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In903350409|, ~weak$$choice2~0=~weak$$choice2~0_In903350409} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out903350409|, ~a$w_buff0~0=~a$w_buff0~0_In903350409, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In903350409, ~a$w_buff0_used~0=~a$w_buff0_used~0_In903350409, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In903350409, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out903350409|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In903350409, ~weak$$choice2~0=~weak$$choice2~0_In903350409} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 21:08:10,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1087242938 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In1087242938 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out1087242938| ~a$w_buff0_used~0_In1087242938) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out1087242938| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1087242938, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1087242938} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1087242938, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1087242938, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1087242938|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 21:08:10,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1753602379 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-1753602379 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-1753602379 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-1753602379 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1753602379| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1753602379| ~a$w_buff1_used~0_In-1753602379) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1753602379, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1753602379, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1753602379, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1753602379} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1753602379, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1753602379, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1753602379, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1753602379|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1753602379} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 21:08:10,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1179181527 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out1179181527| ~a$w_buff1~0_In1179181527) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1179181527 256) 0))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In1179181527 256))) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In1179181527 256) 0)) (= (mod ~a$w_buff0_used~0_In1179181527 256) 0))) (= |P2Thread1of1ForFork0_#t~ite23_Out1179181527| |P2Thread1of1ForFork0_#t~ite24_Out1179181527|)) (and (= ~a$w_buff1~0_In1179181527 |P2Thread1of1ForFork0_#t~ite24_Out1179181527|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In1179181527| |P2Thread1of1ForFork0_#t~ite23_Out1179181527|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In1179181527, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1179181527|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1179181527, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1179181527, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1179181527, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1179181527, ~weak$$choice2~0=~weak$$choice2~0_In1179181527} OutVars{~a$w_buff1~0=~a$w_buff1~0_In1179181527, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1179181527|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1179181527|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1179181527, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1179181527, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1179181527, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1179181527, ~weak$$choice2~0=~weak$$choice2~0_In1179181527} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 21:08:10,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L798-->L798-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1552736590 256)))) (or (and (= ~a$w_buff0_used~0_In-1552736590 |P2Thread1of1ForFork0_#t~ite26_Out-1552736590|) (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1552736590 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In-1552736590 256)) (and (= (mod ~a$w_buff1_used~0_In-1552736590 256) 0) .cse0) (and (= 0 (mod ~a$r_buff1_thd3~0_In-1552736590 256)) .cse0))) .cse1 (= |P2Thread1of1ForFork0_#t~ite27_Out-1552736590| |P2Thread1of1ForFork0_#t~ite26_Out-1552736590|)) (and (= |P2Thread1of1ForFork0_#t~ite26_In-1552736590| |P2Thread1of1ForFork0_#t~ite26_Out-1552736590|) (= ~a$w_buff0_used~0_In-1552736590 |P2Thread1of1ForFork0_#t~ite27_Out-1552736590|) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1552736590|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1552736590, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1552736590, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1552736590, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1552736590, ~weak$$choice2~0=~weak$$choice2~0_In-1552736590} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1552736590|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1552736590|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1552736590, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1552736590, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1552736590, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1552736590, ~weak$$choice2~0=~weak$$choice2~0_In-1552736590} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 21:08:10,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1353326776 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1353326776 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In1353326776 |P1Thread1of1ForFork2_#t~ite13_Out1353326776|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1353326776|) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1353326776, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1353326776} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1353326776, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1353326776, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1353326776|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 21:08:10,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In-780833465 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd2~0_In-780833465 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-780833465 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-780833465 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-780833465| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite14_Out-780833465| ~a$r_buff1_thd2~0_In-780833465) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-780833465, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-780833465, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-780833465, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-780833465} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-780833465, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-780833465, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-780833465, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-780833465, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-780833465|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 21:08:10,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L772-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_17) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 21:08:10,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_51 v_~a$r_buff0_thd3~0_50)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_50, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 21:08:10,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a~0_19 v_~a$mem_tmp~0_5) (= v_~a$flush_delayed~0_7 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_19, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 21:08:10,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1652142290 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1652142290 256)))) (or (and (= ~a~0_In-1652142290 |P2Thread1of1ForFork0_#t~ite38_Out-1652142290|) (or .cse0 .cse1)) (and (not .cse1) (= ~a$w_buff1~0_In-1652142290 |P2Thread1of1ForFork0_#t~ite38_Out-1652142290|) (not .cse0)))) InVars {~a~0=~a~0_In-1652142290, ~a$w_buff1~0=~a$w_buff1~0_In-1652142290, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1652142290, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1652142290} OutVars{~a~0=~a~0_In-1652142290, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1652142290|, ~a$w_buff1~0=~a$w_buff1~0_In-1652142290, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1652142290, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1652142290} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 21:08:10,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_16 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_16, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 21:08:10,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1546674284 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1546674284 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-1546674284| 0)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1546674284| ~a$w_buff0_used~0_In-1546674284) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1546674284, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1546674284} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1546674284|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1546674284, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1546674284} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 21:08:10,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In955290594 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In955290594 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out955290594|)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out955290594| ~a$w_buff0_used~0_In955290594)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In955290594, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In955290594} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out955290594|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In955290594, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In955290594} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 21:08:10,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In610777824 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In610777824 256))) (.cse3 (= (mod ~a$r_buff0_thd1~0_In610777824 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In610777824 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out610777824| 0)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out610777824| ~a$w_buff1_used~0_In610777824) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In610777824, ~a$w_buff0_used~0=~a$w_buff0_used~0_In610777824, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In610777824, ~a$w_buff1_used~0=~a$w_buff1_used~0_In610777824} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out610777824|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In610777824, ~a$w_buff0_used~0=~a$w_buff0_used~0_In610777824, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In610777824, ~a$w_buff1_used~0=~a$w_buff1_used~0_In610777824} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 21:08:10,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In1671431857 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1671431857 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out1671431857 ~a$r_buff0_thd1~0_In1671431857)) (and (not .cse1) (not .cse0) (= ~a$r_buff0_thd1~0_Out1671431857 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1671431857, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1671431857} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1671431857|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1671431857, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1671431857} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:08:10,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1809014556 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1809014556 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1809014556 256))) (.cse3 (= (mod ~a$r_buff1_thd1~0_In-1809014556 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1809014556| ~a$r_buff1_thd1~0_In-1809014556) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out-1809014556| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1809014556, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1809014556, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1809014556, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1809014556} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1809014556|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1809014556, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1809014556, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1809014556, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1809014556} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 21:08:10,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L752-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 21:08:10,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In1505735165 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd3~0_In1505735165 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In1505735165 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1505735165 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out1505735165| ~a$w_buff1_used~0_In1505735165)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite41_Out1505735165| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1505735165, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1505735165, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1505735165, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1505735165} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1505735165, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1505735165, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1505735165, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1505735165, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1505735165|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 21:08:10,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In981673994 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In981673994 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out981673994|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd3~0_In981673994 |P2Thread1of1ForFork0_#t~ite42_Out981673994|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In981673994, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In981673994} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In981673994, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In981673994, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out981673994|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 21:08:10,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In-852017631 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In-852017631 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-852017631 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-852017631 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-852017631| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~a$r_buff1_thd3~0_In-852017631 |P2Thread1of1ForFork0_#t~ite43_Out-852017631|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-852017631, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-852017631, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-852017631, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-852017631} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-852017631|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-852017631, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-852017631, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-852017631, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-852017631} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 21:08:10,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 21:08:10,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:08:10,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In650553545 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In650553545 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out650553545| |ULTIMATE.start_main_#t~ite47_Out650553545|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out650553545| ~a~0_In650553545) .cse2) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out650553545| ~a$w_buff1~0_In650553545) .cse2))) InVars {~a~0=~a~0_In650553545, ~a$w_buff1~0=~a$w_buff1~0_In650553545, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In650553545, ~a$w_buff1_used~0=~a$w_buff1_used~0_In650553545} OutVars{~a~0=~a~0_In650553545, ~a$w_buff1~0=~a$w_buff1~0_In650553545, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out650553545|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In650553545, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out650553545|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In650553545} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 21:08:10,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1896625004 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1896625004 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out1896625004|)) (and (= ~a$w_buff0_used~0_In1896625004 |ULTIMATE.start_main_#t~ite49_Out1896625004|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1896625004, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1896625004} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1896625004, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1896625004|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1896625004} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 21:08:10,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd0~0_In1018136946 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In1018136946 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1018136946 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1018136946 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out1018136946| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite50_Out1018136946| ~a$w_buff1_used~0_In1018136946) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1018136946, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1018136946, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1018136946, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1018136946} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1018136946|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1018136946, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1018136946, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1018136946, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1018136946} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 21:08:10,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1841743232 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In1841743232 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In1841743232 |ULTIMATE.start_main_#t~ite51_Out1841743232|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1841743232|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1841743232, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1841743232} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1841743232|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1841743232, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1841743232} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 21:08:10,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1363793676 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1363793676 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In1363793676 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd0~0_In1363793676 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out1363793676|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~a$r_buff1_thd0~0_In1363793676 |ULTIMATE.start_main_#t~ite52_Out1363793676|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1363793676, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1363793676, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1363793676, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1363793676} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1363793676|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1363793676, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1363793676, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1363793676, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1363793676} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 21:08:10,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_~x~0_13 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= |v_ULTIMATE.start_main_#t~ite52_12| v_~a$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_p1_EAX~0_7) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:08:10,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:08:10 BasicIcfg [2019-12-27 21:08:10,695 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:08:10,696 INFO L168 Benchmark]: Toolchain (without parser) took 132977.63 ms. Allocated memory was 138.4 MB in the beginning and 4.1 GB in the end (delta: 4.0 GB). Free memory was 101.0 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 21:08:10,697 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 21:08:10,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 821.66 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.8 MB in the beginning and 156.6 MB in the end (delta: -55.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:08:10,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.18 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:08:10,698 INFO L168 Benchmark]: Boogie Preprocessor took 41.78 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:08:10,698 INFO L168 Benchmark]: RCFGBuilder took 853.30 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 100.8 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:08:10,699 INFO L168 Benchmark]: TraceAbstraction took 131191.87 ms. Allocated memory was 202.9 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 100.8 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 21:08:10,701 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.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 821.66 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.8 MB in the beginning and 156.6 MB in the end (delta: -55.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.18 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.78 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 853.30 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 100.8 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 131191.87 ms. Allocated memory was 202.9 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 100.8 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7189 VarBasedMoverChecksPositive, 222 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80962 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1013, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1014, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t1015, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=0] [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=0, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=0, z=0] [L782] 3 y = 1 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 130.8s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 56.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7849 SDtfs, 13914 SDslu, 21300 SDs, 0 SdLazy, 22886 SolverSat, 1009 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 747 GetRequests, 182 SyntacticMatches, 70 SemanticMatches, 495 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6583 ImplicationChecksByTransitivity, 15.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141665occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 43.8s AutomataMinimizationTime, 31 MinimizatonAttempts, 501383 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1336 NumberOfCodeBlocks, 1336 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1238 ConstructedInterpolants, 0 QuantifiedInterpolants, 211973 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...