/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/mix042_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:12:59,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:12:59,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:12:59,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:12:59,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:12:59,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:12:59,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:12:59,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:12:59,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:12:59,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:12:59,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:12:59,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:12:59,620 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:12:59,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:12:59,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:12:59,623 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:12:59,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:12:59,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:12:59,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:12:59,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:12:59,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:12:59,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:12:59,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:12:59,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:12:59,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:12:59,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:12:59,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:12:59,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:12:59,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:12:59,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:12:59,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:12:59,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:12:59,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:12:59,641 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:12:59,642 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:12:59,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:12:59,643 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:12:59,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:12:59,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:12:59,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:12:59,645 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:12:59,648 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:12:59,669 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:12:59,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:12:59,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:12:59,671 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:12:59,671 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:12:59,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:12:59,671 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:12:59,672 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:12:59,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:12:59,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:12:59,673 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:12:59,673 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:12:59,673 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:12:59,674 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:12:59,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:12:59,674 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:12:59,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:12:59,675 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:12:59,675 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:12:59,675 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:12:59,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:12:59,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:12:59,676 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:12:59,676 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:12:59,676 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:12:59,676 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:12:59,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:12:59,677 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:12:59,677 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:12:59,677 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:12:59,678 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:12:59,678 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:12:59,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:12:59,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:12:59,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:12:59,985 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:12:59,985 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:12:59,986 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.oepc.i [2019-12-27 21:13:00,078 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d4b5a39e/c56dbf68739f474d9cda704d1506183a/FLAG4d65c7ba5 [2019-12-27 21:13:00,636 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:13:00,637 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_pso.oepc.i [2019-12-27 21:13:00,651 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d4b5a39e/c56dbf68739f474d9cda704d1506183a/FLAG4d65c7ba5 [2019-12-27 21:13:00,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d4b5a39e/c56dbf68739f474d9cda704d1506183a [2019-12-27 21:13:00,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:13:00,899 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:13:00,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:13:00,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:13:00,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:13:00,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:13:00" (1/1) ... [2019-12-27 21:13:00,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e50f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:00, skipping insertion in model container [2019-12-27 21:13:00,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:13:00" (1/1) ... [2019-12-27 21:13:00,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:13:00,988 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:13:01,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:13:01,606 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:13:01,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:13:01,766 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:13:01,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:01 WrapperNode [2019-12-27 21:13:01,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:13:01,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:13:01,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:13:01,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:13:01,777 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:13:01" (1/1) ... [2019-12-27 21:13:01,804 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:13:01" (1/1) ... [2019-12-27 21:13:01,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:13:01,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:13:01,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:13:01,837 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:13:01,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:01" (1/1) ... [2019-12-27 21:13:01,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:01" (1/1) ... [2019-12-27 21:13:01,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:01" (1/1) ... [2019-12-27 21:13:01,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:01" (1/1) ... [2019-12-27 21:13:01,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:01" (1/1) ... [2019-12-27 21:13:01,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:01" (1/1) ... [2019-12-27 21:13:01,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:01" (1/1) ... [2019-12-27 21:13:01,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:13:01,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:13:01,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:13:01,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:13:01,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:01" (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:13:01,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:13:01,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:13:01,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:13:01,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:13:01,938 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:13:01,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:13:01,939 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:13:01,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:13:01,940 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:13:01,941 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:13:01,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:13:01,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:13:01,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:13:01,946 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:13:02,683 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:13:02,683 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:13:02,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:13:02 BoogieIcfgContainer [2019-12-27 21:13:02,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:13:02,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:13:02,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:13:02,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:13:02,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:13:00" (1/3) ... [2019-12-27 21:13:02,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8747b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:13:02, skipping insertion in model container [2019-12-27 21:13:02,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:01" (2/3) ... [2019-12-27 21:13:02,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8747b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:13:02, skipping insertion in model container [2019-12-27 21:13:02,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:13:02" (3/3) ... [2019-12-27 21:13:02,693 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_pso.oepc.i [2019-12-27 21:13:02,703 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:13:02,704 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:13:02,714 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:13:02,715 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:13:02,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,771 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,771 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,772 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,772 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,773 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,780 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,781 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,789 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,790 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,836 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,838 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,845 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,845 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,846 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,848 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,848 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:02,866 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:13:02,885 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:13:02,886 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:13:02,886 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:13:02,886 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:13:02,886 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:13:02,886 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:13:02,886 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:13:02,886 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:13:02,903 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 21:13:02,905 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 21:13:03,012 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 21:13:03,012 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:13:03,028 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:13:03,053 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 21:13:03,108 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 21:13:03,109 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:13:03,117 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:13:03,139 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 21:13:03,141 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:13:06,676 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 21:13:06,816 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 21:13:06,847 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80962 [2019-12-27 21:13:06,847 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 21:13:06,851 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 21:13:23,046 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-27 21:13:23,048 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-27 21:13:23,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:13:23,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:23,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:13:23,056 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:13:23,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:23,062 INFO L82 PathProgramCache]: Analyzing trace with hash 916881, now seen corresponding path program 1 times [2019-12-27 21:13:23,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:23,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528441341] [2019-12-27 21:13:23,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:23,345 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:13:23,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528441341] [2019-12-27 21:13:23,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:23,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:13:23,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2017310675] [2019-12-27 21:13:23,350 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:23,355 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:23,367 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:13:23,368 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:23,372 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:23,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:13:23,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:23,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:13:23,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:23,390 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-27 21:13:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:24,482 INFO L93 Difference]: Finished difference Result 104092 states and 443334 transitions. [2019-12-27 21:13:24,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:13:24,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:13:24,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:27,791 INFO L225 Difference]: With dead ends: 104092 [2019-12-27 21:13:27,791 INFO L226 Difference]: Without dead ends: 97696 [2019-12-27 21:13:27,793 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:13:31,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97696 states. [2019-12-27 21:13:33,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97696 to 97696. [2019-12-27 21:13:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97696 states. [2019-12-27 21:13:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97696 states to 97696 states and 415501 transitions. [2019-12-27 21:13:34,634 INFO L78 Accepts]: Start accepts. Automaton has 97696 states and 415501 transitions. Word has length 3 [2019-12-27 21:13:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:34,635 INFO L462 AbstractCegarLoop]: Abstraction has 97696 states and 415501 transitions. [2019-12-27 21:13:34,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:13:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 97696 states and 415501 transitions. [2019-12-27 21:13:34,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:13:34,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:34,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:34,640 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:13:34,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:34,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1566799458, now seen corresponding path program 1 times [2019-12-27 21:13:34,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:34,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996810500] [2019-12-27 21:13:34,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:34,780 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:13:34,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996810500] [2019-12-27 21:13:34,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:34,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:13:34,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [308136979] [2019-12-27 21:13:34,781 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:34,783 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:34,786 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:13:34,786 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:34,787 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:34,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:13:34,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:34,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:13:34,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:13:34,789 INFO L87 Difference]: Start difference. First operand 97696 states and 415501 transitions. Second operand 4 states. [2019-12-27 21:13:39,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:39,951 INFO L93 Difference]: Finished difference Result 155904 states and 634680 transitions. [2019-12-27 21:13:39,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:13:39,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:13:39,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:40,555 INFO L225 Difference]: With dead ends: 155904 [2019-12-27 21:13:40,556 INFO L226 Difference]: Without dead ends: 155855 [2019-12-27 21:13:40,556 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:13:45,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155855 states. [2019-12-27 21:13:48,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155855 to 141665. [2019-12-27 21:13:48,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141665 states. [2019-12-27 21:13:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141665 states to 141665 states and 584468 transitions. [2019-12-27 21:13:55,108 INFO L78 Accepts]: Start accepts. Automaton has 141665 states and 584468 transitions. Word has length 11 [2019-12-27 21:13:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:55,108 INFO L462 AbstractCegarLoop]: Abstraction has 141665 states and 584468 transitions. [2019-12-27 21:13:55,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:13:55,108 INFO L276 IsEmpty]: Start isEmpty. Operand 141665 states and 584468 transitions. [2019-12-27 21:13:55,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:13:55,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:55,114 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:55,114 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:13:55,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:55,114 INFO L82 PathProgramCache]: Analyzing trace with hash 2120295885, now seen corresponding path program 1 times [2019-12-27 21:13:55,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:55,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711584717] [2019-12-27 21:13:55,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:55,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:13:55,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711584717] [2019-12-27 21:13:55,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:55,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:13:55,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1130329981] [2019-12-27 21:13:55,178 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:55,179 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:55,181 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:13:55,181 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:55,182 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:55,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:13:55,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:55,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:13:55,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:55,183 INFO L87 Difference]: Start difference. First operand 141665 states and 584468 transitions. Second operand 3 states. [2019-12-27 21:13:55,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:55,345 INFO L93 Difference]: Finished difference Result 31684 states and 102658 transitions. [2019-12-27 21:13:55,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:13:55,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:13:55,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:55,400 INFO L225 Difference]: With dead ends: 31684 [2019-12-27 21:13:55,400 INFO L226 Difference]: Without dead ends: 31684 [2019-12-27 21:13:55,401 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:13:55,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31684 states. [2019-12-27 21:13:55,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31684 to 31684. [2019-12-27 21:13:55,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31684 states. [2019-12-27 21:13:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31684 states to 31684 states and 102658 transitions. [2019-12-27 21:13:55,980 INFO L78 Accepts]: Start accepts. Automaton has 31684 states and 102658 transitions. Word has length 13 [2019-12-27 21:13:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:55,980 INFO L462 AbstractCegarLoop]: Abstraction has 31684 states and 102658 transitions. [2019-12-27 21:13:55,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:13:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 31684 states and 102658 transitions. [2019-12-27 21:13:55,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:13:55,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:55,983 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:13:55,983 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:13:55,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:55,983 INFO L82 PathProgramCache]: Analyzing trace with hash -2058055416, now seen corresponding path program 1 times [2019-12-27 21:13:55,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:55,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005953694] [2019-12-27 21:13:55,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:56,079 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:13:56,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005953694] [2019-12-27 21:13:56,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:56,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:13:56,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1968933049] [2019-12-27 21:13:56,080 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:56,083 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:56,085 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:13:56,086 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:56,086 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:56,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:13:56,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:56,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:13:56,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:13:56,087 INFO L87 Difference]: Start difference. First operand 31684 states and 102658 transitions. Second operand 4 states. [2019-12-27 21:13:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:56,455 INFO L93 Difference]: Finished difference Result 39269 states and 126736 transitions. [2019-12-27 21:13:56,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:13:56,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 21:13:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:56,517 INFO L225 Difference]: With dead ends: 39269 [2019-12-27 21:13:56,517 INFO L226 Difference]: Without dead ends: 39269 [2019-12-27 21:13:56,517 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:13:56,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39269 states. [2019-12-27 21:13:59,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39269 to 35204. [2019-12-27 21:13:59,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35204 states. [2019-12-27 21:13:59,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35204 states to 35204 states and 113989 transitions. [2019-12-27 21:13:59,713 INFO L78 Accepts]: Start accepts. Automaton has 35204 states and 113989 transitions. Word has length 16 [2019-12-27 21:13:59,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:59,715 INFO L462 AbstractCegarLoop]: Abstraction has 35204 states and 113989 transitions. [2019-12-27 21:13:59,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:13:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 35204 states and 113989 transitions. [2019-12-27 21:13:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:13:59,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:59,724 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:13:59,724 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:13:59,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:59,725 INFO L82 PathProgramCache]: Analyzing trace with hash -36065168, now seen corresponding path program 1 times [2019-12-27 21:13:59,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:59,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061439235] [2019-12-27 21:13:59,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:59,872 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:13:59,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061439235] [2019-12-27 21:13:59,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:59,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:13:59,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [408937676] [2019-12-27 21:13:59,874 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:59,878 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:59,886 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 54 transitions. [2019-12-27 21:13:59,886 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:00,108 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:14:00,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:14:00,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:00,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:14:00,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:14:00,109 INFO L87 Difference]: Start difference. First operand 35204 states and 113989 transitions. Second operand 8 states. [2019-12-27 21:14:01,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:01,372 INFO L93 Difference]: Finished difference Result 73117 states and 235583 transitions. [2019-12-27 21:14:01,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:14:01,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 21:14:01,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:01,503 INFO L225 Difference]: With dead ends: 73117 [2019-12-27 21:14:01,503 INFO L226 Difference]: Without dead ends: 73110 [2019-12-27 21:14:01,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:14:01,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73110 states. [2019-12-27 21:14:02,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73110 to 34913. [2019-12-27 21:14:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34913 states. [2019-12-27 21:14:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34913 states to 34913 states and 112936 transitions. [2019-12-27 21:14:02,381 INFO L78 Accepts]: Start accepts. Automaton has 34913 states and 112936 transitions. Word has length 22 [2019-12-27 21:14:02,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:02,381 INFO L462 AbstractCegarLoop]: Abstraction has 34913 states and 112936 transitions. [2019-12-27 21:14:02,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:14:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 34913 states and 112936 transitions. [2019-12-27 21:14:02,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:14:02,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:02,693 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:14:02,693 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:14:02,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:02,694 INFO L82 PathProgramCache]: Analyzing trace with hash -74237997, now seen corresponding path program 1 times [2019-12-27 21:14:02,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:02,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650367113] [2019-12-27 21:14:02,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:02,744 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:14:02,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650367113] [2019-12-27 21:14:02,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:02,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:14:02,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [578070568] [2019-12-27 21:14:02,745 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:02,749 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:02,758 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 21:14:02,758 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:02,772 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:14:02,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:14:02,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:02,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:14:02,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:14:02,773 INFO L87 Difference]: Start difference. First operand 34913 states and 112936 transitions. Second operand 5 states. [2019-12-27 21:14:02,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:02,837 INFO L93 Difference]: Finished difference Result 14109 states and 42996 transitions. [2019-12-27 21:14:02,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:14:02,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:14:02,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:02,860 INFO L225 Difference]: With dead ends: 14109 [2019-12-27 21:14:02,860 INFO L226 Difference]: Without dead ends: 14109 [2019-12-27 21:14:02,860 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:14:02,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14109 states. [2019-12-27 21:14:03,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14109 to 13809. [2019-12-27 21:14:03,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13809 states. [2019-12-27 21:14:03,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13809 states to 13809 states and 42140 transitions. [2019-12-27 21:14:03,067 INFO L78 Accepts]: Start accepts. Automaton has 13809 states and 42140 transitions. Word has length 25 [2019-12-27 21:14:03,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:03,067 INFO L462 AbstractCegarLoop]: Abstraction has 13809 states and 42140 transitions. [2019-12-27 21:14:03,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:14:03,068 INFO L276 IsEmpty]: Start isEmpty. Operand 13809 states and 42140 transitions. [2019-12-27 21:14:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:14:03,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:03,078 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:14:03,078 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:14:03,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:03,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1416816819, now seen corresponding path program 1 times [2019-12-27 21:14:03,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:03,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765558600] [2019-12-27 21:14:03,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:03,128 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:14:03,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765558600] [2019-12-27 21:14:03,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:03,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:14:03,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1869246393] [2019-12-27 21:14:03,130 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:03,135 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:03,141 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:14:03,141 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:03,142 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:14:03,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:14:03,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:03,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:14:03,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:14:03,143 INFO L87 Difference]: Start difference. First operand 13809 states and 42140 transitions. Second operand 3 states. [2019-12-27 21:14:03,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:03,241 INFO L93 Difference]: Finished difference Result 19650 states and 58966 transitions. [2019-12-27 21:14:03,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:14:03,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 21:14:03,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:03,267 INFO L225 Difference]: With dead ends: 19650 [2019-12-27 21:14:03,267 INFO L226 Difference]: Without dead ends: 19650 [2019-12-27 21:14:03,268 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:14:03,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19650 states. [2019-12-27 21:14:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19650 to 14555. [2019-12-27 21:14:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14555 states. [2019-12-27 21:14:03,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14555 states to 14555 states and 44278 transitions. [2019-12-27 21:14:03,508 INFO L78 Accepts]: Start accepts. Automaton has 14555 states and 44278 transitions. Word has length 27 [2019-12-27 21:14:03,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:03,509 INFO L462 AbstractCegarLoop]: Abstraction has 14555 states and 44278 transitions. [2019-12-27 21:14:03,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:14:03,509 INFO L276 IsEmpty]: Start isEmpty. Operand 14555 states and 44278 transitions. [2019-12-27 21:14:03,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:14:03,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:03,518 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:14:03,518 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:14:03,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:03,518 INFO L82 PathProgramCache]: Analyzing trace with hash -522150304, now seen corresponding path program 1 times [2019-12-27 21:14:03,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:03,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102261803] [2019-12-27 21:14:03,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:03,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:14:03,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102261803] [2019-12-27 21:14:03,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:03,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:14:03,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1855127111] [2019-12-27 21:14:03,613 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:03,618 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:03,625 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:14:03,625 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:03,625 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:14:03,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:14:03,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:03,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:14:03,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:14:03,626 INFO L87 Difference]: Start difference. First operand 14555 states and 44278 transitions. Second operand 6 states. [2019-12-27 21:14:04,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:04,510 INFO L93 Difference]: Finished difference Result 37188 states and 111594 transitions. [2019-12-27 21:14:04,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:14:04,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:14:04,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:04,584 INFO L225 Difference]: With dead ends: 37188 [2019-12-27 21:14:04,584 INFO L226 Difference]: Without dead ends: 37188 [2019-12-27 21:14:04,585 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:14:04,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37188 states. [2019-12-27 21:14:04,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37188 to 20478. [2019-12-27 21:14:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-27 21:14:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 63215 transitions. [2019-12-27 21:14:05,019 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 63215 transitions. Word has length 27 [2019-12-27 21:14:05,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:05,020 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 63215 transitions. [2019-12-27 21:14:05,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:14:05,020 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 63215 transitions. [2019-12-27 21:14:05,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 21:14:05,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:05,037 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:14:05,037 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:14:05,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:05,037 INFO L82 PathProgramCache]: Analyzing trace with hash -624201971, now seen corresponding path program 1 times [2019-12-27 21:14:05,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:05,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270998104] [2019-12-27 21:14:05,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:05,122 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:14:05,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270998104] [2019-12-27 21:14:05,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:05,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:14:05,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2036139139] [2019-12-27 21:14:05,124 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:05,129 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:05,136 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 21:14:05,137 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:05,137 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:14:05,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:14:05,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:05,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:14:05,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:14:05,138 INFO L87 Difference]: Start difference. First operand 20478 states and 63215 transitions. Second operand 6 states. [2019-12-27 21:14:06,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:06,068 INFO L93 Difference]: Finished difference Result 34478 states and 103330 transitions. [2019-12-27 21:14:06,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:14:06,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 21:14:06,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:06,116 INFO L225 Difference]: With dead ends: 34478 [2019-12-27 21:14:06,116 INFO L226 Difference]: Without dead ends: 34478 [2019-12-27 21:14:06,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:14:06,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34478 states. [2019-12-27 21:14:06,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34478 to 20240. [2019-12-27 21:14:06,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20240 states. [2019-12-27 21:14:06,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20240 states to 20240 states and 62600 transitions. [2019-12-27 21:14:06,495 INFO L78 Accepts]: Start accepts. Automaton has 20240 states and 62600 transitions. Word has length 28 [2019-12-27 21:14:06,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:06,495 INFO L462 AbstractCegarLoop]: Abstraction has 20240 states and 62600 transitions. [2019-12-27 21:14:06,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:14:06,496 INFO L276 IsEmpty]: Start isEmpty. Operand 20240 states and 62600 transitions. [2019-12-27 21:14:06,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:14:06,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:06,517 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:14:06,517 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:14:06,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:06,517 INFO L82 PathProgramCache]: Analyzing trace with hash -160608776, now seen corresponding path program 1 times [2019-12-27 21:14:06,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:06,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255414313] [2019-12-27 21:14:06,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:06,625 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:14:06,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255414313] [2019-12-27 21:14:06,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:06,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:14:06,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1763689594] [2019-12-27 21:14:06,626 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:06,632 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:06,646 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 65 transitions. [2019-12-27 21:14:06,647 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:06,819 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:14:06,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:14:06,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:06,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:14:06,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:14:06,821 INFO L87 Difference]: Start difference. First operand 20240 states and 62600 transitions. Second operand 10 states. [2019-12-27 21:14:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:09,581 INFO L93 Difference]: Finished difference Result 69823 states and 209190 transitions. [2019-12-27 21:14:09,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 21:14:09,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-12-27 21:14:09,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:09,690 INFO L225 Difference]: With dead ends: 69823 [2019-12-27 21:14:09,691 INFO L226 Difference]: Without dead ends: 69823 [2019-12-27 21:14:09,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-12-27 21:14:09,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69823 states. [2019-12-27 21:14:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69823 to 21771. [2019-12-27 21:14:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21771 states. [2019-12-27 21:14:10,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21771 states to 21771 states and 67265 transitions. [2019-12-27 21:14:10,374 INFO L78 Accepts]: Start accepts. Automaton has 21771 states and 67265 transitions. Word has length 33 [2019-12-27 21:14:10,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:10,374 INFO L462 AbstractCegarLoop]: Abstraction has 21771 states and 67265 transitions. [2019-12-27 21:14:10,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:14:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 21771 states and 67265 transitions. [2019-12-27 21:14:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:14:10,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:10,397 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:14:10,397 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:14:10,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:10,398 INFO L82 PathProgramCache]: Analyzing trace with hash 88321435, now seen corresponding path program 1 times [2019-12-27 21:14:10,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:10,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512574854] [2019-12-27 21:14:10,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:10,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:10,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512574854] [2019-12-27 21:14:10,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:10,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:14:10,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [968446934] [2019-12-27 21:14:10,442 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:10,662 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:10,678 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 71 transitions. [2019-12-27 21:14:10,679 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:10,681 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:14:10,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:14:10,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:10,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:14:10,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:14:10,682 INFO L87 Difference]: Start difference. First operand 21771 states and 67265 transitions. Second operand 3 states. [2019-12-27 21:14:10,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:10,845 INFO L93 Difference]: Finished difference Result 29013 states and 86739 transitions. [2019-12-27 21:14:10,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:14:10,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 21:14:10,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:10,914 INFO L225 Difference]: With dead ends: 29013 [2019-12-27 21:14:10,914 INFO L226 Difference]: Without dead ends: 29013 [2019-12-27 21:14:10,915 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:14:11,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29013 states. [2019-12-27 21:14:11,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29013 to 20501. [2019-12-27 21:14:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20501 states. [2019-12-27 21:14:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20501 states to 20501 states and 61416 transitions. [2019-12-27 21:14:11,448 INFO L78 Accepts]: Start accepts. Automaton has 20501 states and 61416 transitions. Word has length 33 [2019-12-27 21:14:11,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:11,448 INFO L462 AbstractCegarLoop]: Abstraction has 20501 states and 61416 transitions. [2019-12-27 21:14:11,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:14:11,448 INFO L276 IsEmpty]: Start isEmpty. Operand 20501 states and 61416 transitions. [2019-12-27 21:14:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:14:11,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:11,466 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:14:11,466 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:14:11,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:11,466 INFO L82 PathProgramCache]: Analyzing trace with hash 838482894, now seen corresponding path program 2 times [2019-12-27 21:14:11,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:11,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215342148] [2019-12-27 21:14:11,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:11,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:11,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215342148] [2019-12-27 21:14:11,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:11,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:14:11,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1956799133] [2019-12-27 21:14:11,600 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:11,606 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:11,623 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 73 transitions. [2019-12-27 21:14:11,623 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:11,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:14:11,651 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:14:11,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:14:11,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:11,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:14:11,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:14:11,653 INFO L87 Difference]: Start difference. First operand 20501 states and 61416 transitions. Second operand 9 states. [2019-12-27 21:14:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:14,674 INFO L93 Difference]: Finished difference Result 62586 states and 182614 transitions. [2019-12-27 21:14:14,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 21:14:14,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 21:14:14,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:14,815 INFO L225 Difference]: With dead ends: 62586 [2019-12-27 21:14:14,815 INFO L226 Difference]: Without dead ends: 62586 [2019-12-27 21:14:14,817 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:14:14,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62586 states. [2019-12-27 21:14:15,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62586 to 23222. [2019-12-27 21:14:15,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23222 states. [2019-12-27 21:14:15,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23222 states to 23222 states and 69697 transitions. [2019-12-27 21:14:15,469 INFO L78 Accepts]: Start accepts. Automaton has 23222 states and 69697 transitions. Word has length 33 [2019-12-27 21:14:15,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:15,469 INFO L462 AbstractCegarLoop]: Abstraction has 23222 states and 69697 transitions. [2019-12-27 21:14:15,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:14:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand 23222 states and 69697 transitions. [2019-12-27 21:14:15,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:14:15,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:15,702 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:14:15,702 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:14:15,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:15,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1993650805, now seen corresponding path program 1 times [2019-12-27 21:14:15,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:15,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332831010] [2019-12-27 21:14:15,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:15,809 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:14:15,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332831010] [2019-12-27 21:14:15,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:15,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:14:15,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [650015334] [2019-12-27 21:14:15,810 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:15,817 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:15,833 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 66 transitions. [2019-12-27 21:14:15,833 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:16,009 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:14:16,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:14:16,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:16,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:14:16,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:14:16,011 INFO L87 Difference]: Start difference. First operand 23222 states and 69697 transitions. Second operand 10 states. [2019-12-27 21:14:18,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:18,409 INFO L93 Difference]: Finished difference Result 53461 states and 158997 transitions. [2019-12-27 21:14:18,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 21:14:18,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-27 21:14:18,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:18,494 INFO L225 Difference]: With dead ends: 53461 [2019-12-27 21:14:18,494 INFO L226 Difference]: Without dead ends: 53461 [2019-12-27 21:14:18,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-12-27 21:14:18,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53461 states. [2019-12-27 21:14:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53461 to 22086. [2019-12-27 21:14:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22086 states. [2019-12-27 21:14:19,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22086 states to 22086 states and 66380 transitions. [2019-12-27 21:14:19,039 INFO L78 Accepts]: Start accepts. Automaton has 22086 states and 66380 transitions. Word has length 34 [2019-12-27 21:14:19,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:19,039 INFO L462 AbstractCegarLoop]: Abstraction has 22086 states and 66380 transitions. [2019-12-27 21:14:19,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:14:19,039 INFO L276 IsEmpty]: Start isEmpty. Operand 22086 states and 66380 transitions. [2019-12-27 21:14:19,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:14:19,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:19,058 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:14:19,059 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:14:19,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:19,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1065822653, now seen corresponding path program 2 times [2019-12-27 21:14:19,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:19,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166407879] [2019-12-27 21:14:19,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:19,277 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:14:19,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166407879] [2019-12-27 21:14:19,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:19,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:14:19,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [19012763] [2019-12-27 21:14:19,278 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:19,285 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:19,299 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 56 transitions. [2019-12-27 21:14:19,300 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:19,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:14:19,320 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:14:19,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:14:19,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:19,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:14:19,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:14:19,321 INFO L87 Difference]: Start difference. First operand 22086 states and 66380 transitions. Second operand 11 states. [2019-12-27 21:14:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:23,831 INFO L93 Difference]: Finished difference Result 51265 states and 149310 transitions. [2019-12-27 21:14:23,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 21:14:23,831 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-12-27 21:14:23,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:23,905 INFO L225 Difference]: With dead ends: 51265 [2019-12-27 21:14:23,905 INFO L226 Difference]: Without dead ends: 51265 [2019-12-27 21:14:23,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=358, Invalid=1534, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 21:14:24,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51265 states. [2019-12-27 21:14:24,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51265 to 21395. [2019-12-27 21:14:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21395 states. [2019-12-27 21:14:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21395 states to 21395 states and 64377 transitions. [2019-12-27 21:14:24,422 INFO L78 Accepts]: Start accepts. Automaton has 21395 states and 64377 transitions. Word has length 34 [2019-12-27 21:14:24,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:24,422 INFO L462 AbstractCegarLoop]: Abstraction has 21395 states and 64377 transitions. [2019-12-27 21:14:24,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:14:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 21395 states and 64377 transitions. [2019-12-27 21:14:24,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 21:14:24,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:24,449 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:14:24,449 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:14:24,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:24,449 INFO L82 PathProgramCache]: Analyzing trace with hash -565888573, now seen corresponding path program 1 times [2019-12-27 21:14:24,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:24,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017848105] [2019-12-27 21:14:24,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:24,558 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:14:24,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017848105] [2019-12-27 21:14:24,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:24,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:14:24,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [311722671] [2019-12-27 21:14:24,559 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:24,567 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:24,594 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 102 transitions. [2019-12-27 21:14:24,595 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:24,609 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:14:24,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:14:24,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:24,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:14:24,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:14:24,610 INFO L87 Difference]: Start difference. First operand 21395 states and 64377 transitions. Second operand 7 states. [2019-12-27 21:14:25,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:25,816 INFO L93 Difference]: Finished difference Result 47158 states and 137331 transitions. [2019-12-27 21:14:25,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:14:25,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-12-27 21:14:25,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:25,881 INFO L225 Difference]: With dead ends: 47158 [2019-12-27 21:14:25,881 INFO L226 Difference]: Without dead ends: 47158 [2019-12-27 21:14:25,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-27 21:14:26,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47158 states. [2019-12-27 21:14:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47158 to 20291. [2019-12-27 21:14:26,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20291 states. [2019-12-27 21:14:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20291 states to 20291 states and 61060 transitions. [2019-12-27 21:14:26,359 INFO L78 Accepts]: Start accepts. Automaton has 20291 states and 61060 transitions. Word has length 38 [2019-12-27 21:14:26,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:26,359 INFO L462 AbstractCegarLoop]: Abstraction has 20291 states and 61060 transitions. [2019-12-27 21:14:26,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:14:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 20291 states and 61060 transitions. [2019-12-27 21:14:26,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:14:26,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:26,377 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:14:26,377 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:14:26,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:26,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2067431116, now seen corresponding path program 1 times [2019-12-27 21:14:26,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:26,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233290065] [2019-12-27 21:14:26,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:26,435 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:14:26,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233290065] [2019-12-27 21:14:26,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:26,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:14:26,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [859790929] [2019-12-27 21:14:26,437 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:26,444 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:26,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 355 transitions. [2019-12-27 21:14:26,511 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:26,574 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:14:26,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:14:26,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:26,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:14:26,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:14:26,577 INFO L87 Difference]: Start difference. First operand 20291 states and 61060 transitions. Second operand 7 states. [2019-12-27 21:14:27,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:27,133 INFO L93 Difference]: Finished difference Result 39551 states and 119487 transitions. [2019-12-27 21:14:27,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:14:27,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-27 21:14:27,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:27,164 INFO L225 Difference]: With dead ends: 39551 [2019-12-27 21:14:27,164 INFO L226 Difference]: Without dead ends: 22294 [2019-12-27 21:14:27,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:14:27,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22294 states. [2019-12-27 21:14:27,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22294 to 18728. [2019-12-27 21:14:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18728 states. [2019-12-27 21:14:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18728 states to 18728 states and 55260 transitions. [2019-12-27 21:14:27,768 INFO L78 Accepts]: Start accepts. Automaton has 18728 states and 55260 transitions. Word has length 39 [2019-12-27 21:14:27,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:27,769 INFO L462 AbstractCegarLoop]: Abstraction has 18728 states and 55260 transitions. [2019-12-27 21:14:27,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:14:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 18728 states and 55260 transitions. [2019-12-27 21:14:27,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:14:27,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:27,786 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:14:27,786 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:14:27,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:27,786 INFO L82 PathProgramCache]: Analyzing trace with hash -757785660, now seen corresponding path program 2 times [2019-12-27 21:14:27,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:27,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602219524] [2019-12-27 21:14:27,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:27,830 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:14:27,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602219524] [2019-12-27 21:14:27,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:27,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:14:27,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1546834654] [2019-12-27 21:14:27,831 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:27,839 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:27,898 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 351 transitions. [2019-12-27 21:14:27,898 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:27,911 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:14:27,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:14:27,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:27,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:14:27,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:14:27,913 INFO L87 Difference]: Start difference. First operand 18728 states and 55260 transitions. Second operand 4 states. [2019-12-27 21:14:28,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:28,012 INFO L93 Difference]: Finished difference Result 33733 states and 99551 transitions. [2019-12-27 21:14:28,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:14:28,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 21:14:28,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:28,037 INFO L225 Difference]: With dead ends: 33733 [2019-12-27 21:14:28,037 INFO L226 Difference]: Without dead ends: 17371 [2019-12-27 21:14:28,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:14:28,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17371 states. [2019-12-27 21:14:28,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17371 to 17315. [2019-12-27 21:14:28,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17315 states. [2019-12-27 21:14:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17315 states to 17315 states and 49809 transitions. [2019-12-27 21:14:28,277 INFO L78 Accepts]: Start accepts. Automaton has 17315 states and 49809 transitions. Word has length 39 [2019-12-27 21:14:28,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:28,277 INFO L462 AbstractCegarLoop]: Abstraction has 17315 states and 49809 transitions. [2019-12-27 21:14:28,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:14:28,278 INFO L276 IsEmpty]: Start isEmpty. Operand 17315 states and 49809 transitions. [2019-12-27 21:14:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 21:14:28,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:28,294 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:14:28,294 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:14:28,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:28,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1539619421, now seen corresponding path program 1 times [2019-12-27 21:14:28,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:28,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860459209] [2019-12-27 21:14:28,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:28,348 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:14:28,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860459209] [2019-12-27 21:14:28,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:28,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:14:28,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1421352513] [2019-12-27 21:14:28,350 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:28,358 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:28,452 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 423 transitions. [2019-12-27 21:14:28,453 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:28,486 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:14:28,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:14:28,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:28,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:14:28,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:14:28,487 INFO L87 Difference]: Start difference. First operand 17315 states and 49809 transitions. Second operand 7 states. [2019-12-27 21:14:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:28,588 INFO L93 Difference]: Finished difference Result 16080 states and 47014 transitions. [2019-12-27 21:14:28,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:14:28,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 21:14:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:28,614 INFO L225 Difference]: With dead ends: 16080 [2019-12-27 21:14:28,614 INFO L226 Difference]: Without dead ends: 12991 [2019-12-27 21:14:28,614 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:14:28,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12991 states. [2019-12-27 21:14:28,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12991 to 12459. [2019-12-27 21:14:28,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12459 states. [2019-12-27 21:14:28,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12459 states to 12459 states and 38681 transitions. [2019-12-27 21:14:28,848 INFO L78 Accepts]: Start accepts. Automaton has 12459 states and 38681 transitions. Word has length 40 [2019-12-27 21:14:28,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:28,848 INFO L462 AbstractCegarLoop]: Abstraction has 12459 states and 38681 transitions. [2019-12-27 21:14:28,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:14:28,848 INFO L276 IsEmpty]: Start isEmpty. Operand 12459 states and 38681 transitions. [2019-12-27 21:14:28,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:14:28,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:28,862 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:14:28,862 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:14:28,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:28,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1729634848, now seen corresponding path program 1 times [2019-12-27 21:14:28,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:28,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927997994] [2019-12-27 21:14:28,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:28,985 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:14:28,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927997994] [2019-12-27 21:14:28,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:28,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:14:28,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [193812266] [2019-12-27 21:14:28,986 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:29,007 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:29,191 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 248 states and 487 transitions. [2019-12-27 21:14:29,191 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:29,401 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 21:14:29,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:14:29,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:29,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:14:29,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:14:29,402 INFO L87 Difference]: Start difference. First operand 12459 states and 38681 transitions. Second operand 11 states. [2019-12-27 21:14:33,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:33,163 INFO L93 Difference]: Finished difference Result 81117 states and 243665 transitions. [2019-12-27 21:14:33,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-27 21:14:33,163 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 21:14:33,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:33,252 INFO L225 Difference]: With dead ends: 81117 [2019-12-27 21:14:33,252 INFO L226 Difference]: Without dead ends: 60820 [2019-12-27 21:14:33,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 29 SyntacticMatches, 14 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=710, Invalid=2830, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 21:14:33,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60820 states. [2019-12-27 21:14:33,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60820 to 14479. [2019-12-27 21:14:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14479 states. [2019-12-27 21:14:33,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14479 states to 14479 states and 44946 transitions. [2019-12-27 21:14:33,822 INFO L78 Accepts]: Start accepts. Automaton has 14479 states and 44946 transitions. Word has length 64 [2019-12-27 21:14:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:33,822 INFO L462 AbstractCegarLoop]: Abstraction has 14479 states and 44946 transitions. [2019-12-27 21:14:33,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:14:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 14479 states and 44946 transitions. [2019-12-27 21:14:33,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:14:33,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:33,839 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:14:33,839 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:14:33,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:33,839 INFO L82 PathProgramCache]: Analyzing trace with hash 2099431100, now seen corresponding path program 2 times [2019-12-27 21:14:33,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:33,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856082063] [2019-12-27 21:14:33,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:33,932 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:14:33,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856082063] [2019-12-27 21:14:33,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:33,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:14:33,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [895454698] [2019-12-27 21:14:33,933 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:33,954 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:34,184 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 332 transitions. [2019-12-27 21:14:34,184 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:34,241 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:14:34,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:14:34,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:34,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:14:34,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:14:34,242 INFO L87 Difference]: Start difference. First operand 14479 states and 44946 transitions. Second operand 10 states. [2019-12-27 21:14:35,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:35,786 INFO L93 Difference]: Finished difference Result 37535 states and 113060 transitions. [2019-12-27 21:14:35,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:14:35,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 21:14:35,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:35,826 INFO L225 Difference]: With dead ends: 37535 [2019-12-27 21:14:35,827 INFO L226 Difference]: Without dead ends: 27688 [2019-12-27 21:14:35,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-12-27 21:14:35,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27688 states. [2019-12-27 21:14:36,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27688 to 16372. [2019-12-27 21:14:36,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16372 states. [2019-12-27 21:14:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16372 states to 16372 states and 50408 transitions. [2019-12-27 21:14:36,177 INFO L78 Accepts]: Start accepts. Automaton has 16372 states and 50408 transitions. Word has length 64 [2019-12-27 21:14:36,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:36,177 INFO L462 AbstractCegarLoop]: Abstraction has 16372 states and 50408 transitions. [2019-12-27 21:14:36,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:14:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 16372 states and 50408 transitions. [2019-12-27 21:14:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:14:36,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:36,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:14:36,195 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:14:36,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:36,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1686766406, now seen corresponding path program 3 times [2019-12-27 21:14:36,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:36,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716783394] [2019-12-27 21:14:36,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:36,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716783394] [2019-12-27 21:14:36,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:36,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:14:36,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1968723086] [2019-12-27 21:14:36,266 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:36,285 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:36,860 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 284 states and 557 transitions. [2019-12-27 21:14:36,861 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:37,054 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 21:14:37,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:14:37,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:37,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:14:37,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:14:37,055 INFO L87 Difference]: Start difference. First operand 16372 states and 50408 transitions. Second operand 11 states. [2019-12-27 21:14:38,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:38,527 INFO L93 Difference]: Finished difference Result 33560 states and 102088 transitions. [2019-12-27 21:14:38,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:14:38,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 21:14:38,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:38,562 INFO L225 Difference]: With dead ends: 33560 [2019-12-27 21:14:38,562 INFO L226 Difference]: Without dead ends: 25006 [2019-12-27 21:14:38,563 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:14:38,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25006 states. [2019-12-27 21:14:38,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25006 to 16660. [2019-12-27 21:14:38,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16660 states. [2019-12-27 21:14:38,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16660 states to 16660 states and 51260 transitions. [2019-12-27 21:14:38,880 INFO L78 Accepts]: Start accepts. Automaton has 16660 states and 51260 transitions. Word has length 64 [2019-12-27 21:14:38,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:38,880 INFO L462 AbstractCegarLoop]: Abstraction has 16660 states and 51260 transitions. [2019-12-27 21:14:38,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:14:38,880 INFO L276 IsEmpty]: Start isEmpty. Operand 16660 states and 51260 transitions. [2019-12-27 21:14:38,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:14:38,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:38,898 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:14:38,898 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:14:38,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:38,899 INFO L82 PathProgramCache]: Analyzing trace with hash 2033773150, now seen corresponding path program 4 times [2019-12-27 21:14:38,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:38,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728878723] [2019-12-27 21:14:38,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:38,963 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:14:38,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728878723] [2019-12-27 21:14:38,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:38,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:14:38,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [747933077] [2019-12-27 21:14:38,964 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:38,983 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:39,146 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 192 states and 339 transitions. [2019-12-27 21:14:39,146 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:39,147 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:14:39,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:14:39,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:39,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:14:39,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:14:39,148 INFO L87 Difference]: Start difference. First operand 16660 states and 51260 transitions. Second operand 3 states. [2019-12-27 21:14:39,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:39,262 INFO L93 Difference]: Finished difference Result 19217 states and 58990 transitions. [2019-12-27 21:14:39,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:14:39,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 21:14:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:39,290 INFO L225 Difference]: With dead ends: 19217 [2019-12-27 21:14:39,290 INFO L226 Difference]: Without dead ends: 19217 [2019-12-27 21:14:39,290 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:14:39,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19217 states. [2019-12-27 21:14:39,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19217 to 17260. [2019-12-27 21:14:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17260 states. [2019-12-27 21:14:39,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17260 states to 17260 states and 53245 transitions. [2019-12-27 21:14:39,593 INFO L78 Accepts]: Start accepts. Automaton has 17260 states and 53245 transitions. Word has length 64 [2019-12-27 21:14:39,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:39,593 INFO L462 AbstractCegarLoop]: Abstraction has 17260 states and 53245 transitions. [2019-12-27 21:14:39,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:14:39,593 INFO L276 IsEmpty]: Start isEmpty. Operand 17260 states and 53245 transitions. [2019-12-27 21:14:39,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:14:39,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:39,613 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:14:39,614 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:14:39,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:39,614 INFO L82 PathProgramCache]: Analyzing trace with hash -2130207003, now seen corresponding path program 1 times [2019-12-27 21:14:39,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:39,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753506765] [2019-12-27 21:14:39,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:39,663 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:14:39,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753506765] [2019-12-27 21:14:39,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:39,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:14:39,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [262310705] [2019-12-27 21:14:39,664 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:39,685 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:40,130 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 216 states and 384 transitions. [2019-12-27 21:14:40,130 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:40,193 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 21:14:40,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:14:40,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:40,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:14:40,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:14:40,194 INFO L87 Difference]: Start difference. First operand 17260 states and 53245 transitions. Second operand 6 states. [2019-12-27 21:14:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:40,773 INFO L93 Difference]: Finished difference Result 32785 states and 100245 transitions. [2019-12-27 21:14:40,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:14:40,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 21:14:40,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:40,822 INFO L225 Difference]: With dead ends: 32785 [2019-12-27 21:14:40,822 INFO L226 Difference]: Without dead ends: 32785 [2019-12-27 21:14:40,822 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:14:40,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32785 states. [2019-12-27 21:14:41,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32785 to 18249. [2019-12-27 21:14:41,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18249 states. [2019-12-27 21:14:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18249 states to 18249 states and 56208 transitions. [2019-12-27 21:14:41,219 INFO L78 Accepts]: Start accepts. Automaton has 18249 states and 56208 transitions. Word has length 65 [2019-12-27 21:14:41,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:41,220 INFO L462 AbstractCegarLoop]: Abstraction has 18249 states and 56208 transitions. [2019-12-27 21:14:41,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:14:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 18249 states and 56208 transitions. [2019-12-27 21:14:41,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:14:41,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:41,239 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:14:41,239 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:14:41,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:41,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1707397215, now seen corresponding path program 2 times [2019-12-27 21:14:41,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:41,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222367849] [2019-12-27 21:14:41,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:41,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222367849] [2019-12-27 21:14:41,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:41,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:14:41,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [797198932] [2019-12-27 21:14:41,339 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:41,359 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:41,542 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 218 states and 407 transitions. [2019-12-27 21:14:41,542 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:41,701 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:14:41,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:14:41,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:41,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:14:41,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:14:41,703 INFO L87 Difference]: Start difference. First operand 18249 states and 56208 transitions. Second operand 12 states. [2019-12-27 21:14:43,331 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 21:14:43,568 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-27 21:14:43,703 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 21:14:44,162 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 21:14:44,307 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 21:14:45,149 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 21:14:46,374 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 21:14:46,636 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 21:14:46,831 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 21:14:47,059 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 21:14:48,080 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 21:14:48,896 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 21:14:50,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:50,956 INFO L93 Difference]: Finished difference Result 56765 states and 171634 transitions. [2019-12-27 21:14:50,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-12-27 21:14:50,957 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 21:14:50,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:51,033 INFO L225 Difference]: With dead ends: 56765 [2019-12-27 21:14:51,034 INFO L226 Difference]: Without dead ends: 49246 [2019-12-27 21:14:51,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2391 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1103, Invalid=5539, Unknown=0, NotChecked=0, Total=6642 [2019-12-27 21:14:51,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49246 states. [2019-12-27 21:14:51,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49246 to 18460. [2019-12-27 21:14:51,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18460 states. [2019-12-27 21:14:51,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18460 states to 18460 states and 56909 transitions. [2019-12-27 21:14:51,580 INFO L78 Accepts]: Start accepts. Automaton has 18460 states and 56909 transitions. Word has length 65 [2019-12-27 21:14:51,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:51,581 INFO L462 AbstractCegarLoop]: Abstraction has 18460 states and 56909 transitions. [2019-12-27 21:14:51,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:14:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 18460 states and 56909 transitions. [2019-12-27 21:14:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:14:51,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:51,599 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:14:51,599 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:14:51,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:51,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1138162659, now seen corresponding path program 3 times [2019-12-27 21:14:51,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:51,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246643952] [2019-12-27 21:14:51,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:51,699 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:14:51,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246643952] [2019-12-27 21:14:51,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:51,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:14:51,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [521192089] [2019-12-27 21:14:51,700 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:51,718 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:52,053 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 231 states and 438 transitions. [2019-12-27 21:14:52,054 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:52,352 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:14:52,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:14:52,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:52,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:14:52,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:14:52,353 INFO L87 Difference]: Start difference. First operand 18460 states and 56909 transitions. Second operand 12 states. [2019-12-27 21:14:56,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:56,847 INFO L93 Difference]: Finished difference Result 86392 states and 262045 transitions. [2019-12-27 21:14:56,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-27 21:14:56,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 21:14:56,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:56,947 INFO L225 Difference]: With dead ends: 86392 [2019-12-27 21:14:56,948 INFO L226 Difference]: Without dead ends: 65147 [2019-12-27 21:14:56,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=821, Invalid=3339, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 21:14:57,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65147 states. [2019-12-27 21:14:57,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65147 to 20621. [2019-12-27 21:14:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20621 states. [2019-12-27 21:14:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20621 states to 20621 states and 63126 transitions. [2019-12-27 21:14:57,619 INFO L78 Accepts]: Start accepts. Automaton has 20621 states and 63126 transitions. Word has length 65 [2019-12-27 21:14:57,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:57,620 INFO L462 AbstractCegarLoop]: Abstraction has 20621 states and 63126 transitions. [2019-12-27 21:14:57,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:14:57,620 INFO L276 IsEmpty]: Start isEmpty. Operand 20621 states and 63126 transitions. [2019-12-27 21:14:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:14:57,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:57,642 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:14:57,642 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:14:57,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:57,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1698966502, now seen corresponding path program 1 times [2019-12-27 21:14:57,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:57,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813488611] [2019-12-27 21:14:57,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:57,715 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:14:57,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813488611] [2019-12-27 21:14:57,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:57,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:14:57,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1028794131] [2019-12-27 21:14:57,716 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:57,736 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:57,962 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 319 transitions. [2019-12-27 21:14:57,963 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:58,028 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 21:14:58,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:14:58,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:58,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:14:58,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:14:58,030 INFO L87 Difference]: Start difference. First operand 20621 states and 63126 transitions. Second operand 7 states. [2019-12-27 21:14:59,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:59,116 INFO L93 Difference]: Finished difference Result 32906 states and 98229 transitions. [2019-12-27 21:14:59,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:14:59,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 21:14:59,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:59,160 INFO L225 Difference]: With dead ends: 32906 [2019-12-27 21:14:59,160 INFO L226 Difference]: Without dead ends: 32686 [2019-12-27 21:14:59,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:14:59,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32686 states. [2019-12-27 21:14:59,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32686 to 25881. [2019-12-27 21:14:59,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25881 states. [2019-12-27 21:14:59,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25881 states to 25881 states and 78345 transitions. [2019-12-27 21:14:59,986 INFO L78 Accepts]: Start accepts. Automaton has 25881 states and 78345 transitions. Word has length 65 [2019-12-27 21:14:59,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:59,986 INFO L462 AbstractCegarLoop]: Abstraction has 25881 states and 78345 transitions. [2019-12-27 21:14:59,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:14:59,987 INFO L276 IsEmpty]: Start isEmpty. Operand 25881 states and 78345 transitions. [2019-12-27 21:15:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:15:00,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:15:00,011 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:15:00,011 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:15:00,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:15:00,012 INFO L82 PathProgramCache]: Analyzing trace with hash -568944948, now seen corresponding path program 2 times [2019-12-27 21:15:00,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:15:00,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298122227] [2019-12-27 21:15:00,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:15:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:15:00,073 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:15:00,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298122227] [2019-12-27 21:15:00,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:15:00,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:15:00,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [626903659] [2019-12-27 21:15:00,074 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:15:00,094 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:15:00,235 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 193 states and 337 transitions. [2019-12-27 21:15:00,236 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:15:00,236 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:15:00,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:15:00,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:15:00,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:15:00,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:15:00,237 INFO L87 Difference]: Start difference. First operand 25881 states and 78345 transitions. Second operand 3 states. [2019-12-27 21:15:00,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:15:00,308 INFO L93 Difference]: Finished difference Result 25881 states and 78344 transitions. [2019-12-27 21:15:00,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:15:00,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:15:00,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:15:00,344 INFO L225 Difference]: With dead ends: 25881 [2019-12-27 21:15:00,344 INFO L226 Difference]: Without dead ends: 25881 [2019-12-27 21:15:00,345 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:15:00,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25881 states. [2019-12-27 21:15:00,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25881 to 21149. [2019-12-27 21:15:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21149 states. [2019-12-27 21:15:00,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21149 states to 21149 states and 64987 transitions. [2019-12-27 21:15:00,691 INFO L78 Accepts]: Start accepts. Automaton has 21149 states and 64987 transitions. Word has length 65 [2019-12-27 21:15:00,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:15:00,691 INFO L462 AbstractCegarLoop]: Abstraction has 21149 states and 64987 transitions. [2019-12-27 21:15:00,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:15:00,691 INFO L276 IsEmpty]: Start isEmpty. Operand 21149 states and 64987 transitions. [2019-12-27 21:15:00,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:15:00,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:15:00,711 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:15:00,711 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:15:00,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:15:00,711 INFO L82 PathProgramCache]: Analyzing trace with hash 603021477, now seen corresponding path program 1 times [2019-12-27 21:15:00,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:15:00,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579977891] [2019-12-27 21:15:00,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:15:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:15:00,768 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:15:00,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579977891] [2019-12-27 21:15:00,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:15:00,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:15:00,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1333564992] [2019-12-27 21:15:00,769 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:15:00,789 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:15:00,940 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 183 states and 305 transitions. [2019-12-27 21:15:00,940 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:15:00,948 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:15:00,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:15:00,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:15:00,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:15:00,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:15:00,949 INFO L87 Difference]: Start difference. First operand 21149 states and 64987 transitions. Second operand 4 states. [2019-12-27 21:15:01,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:15:01,016 INFO L93 Difference]: Finished difference Result 16092 states and 48805 transitions. [2019-12-27 21:15:01,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:15:01,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 21:15:01,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:15:01,037 INFO L225 Difference]: With dead ends: 16092 [2019-12-27 21:15:01,037 INFO L226 Difference]: Without dead ends: 16092 [2019-12-27 21:15:01,037 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:15:01,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16092 states. [2019-12-27 21:15:01,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16092 to 15804. [2019-12-27 21:15:01,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15804 states. [2019-12-27 21:15:01,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15804 states to 15804 states and 47995 transitions. [2019-12-27 21:15:01,279 INFO L78 Accepts]: Start accepts. Automaton has 15804 states and 47995 transitions. Word has length 66 [2019-12-27 21:15:01,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:15:01,279 INFO L462 AbstractCegarLoop]: Abstraction has 15804 states and 47995 transitions. [2019-12-27 21:15:01,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:15:01,279 INFO L276 IsEmpty]: Start isEmpty. Operand 15804 states and 47995 transitions. [2019-12-27 21:15:01,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:15:01,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:15:01,294 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:15:01,294 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:15:01,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:15:01,294 INFO L82 PathProgramCache]: Analyzing trace with hash -611821270, now seen corresponding path program 1 times [2019-12-27 21:15:01,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:15:01,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53499303] [2019-12-27 21:15:01,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:15:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:15:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:15:01,453 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:15:01,453 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:15:01,458 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) (= v_~x~0_11 0) (= 0 v_~a$mem_tmp~0_9) (= v_~a~0_26 0) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t1111~0.base_23| 1)) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1111~0.base_23|) (= v_~a$r_buff0_thd0~0_20 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~y~0_14 0) (= 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) (= v_~a$r_buff0_thd3~0_77 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1111~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1111~0.base_23|) |v_ULTIMATE.start_main_~#t1111~0.offset_18| 0)) |v_#memory_int_21|) (= v_~a$flush_delayed~0_12 0) (= 0 |v_ULTIMATE.start_main_~#t1111~0.offset_18|) (= 0 v_~a$r_buff1_thd0~0_26) (= 0 v_~a$w_buff0~0_23) (= 0 v_~a$w_buff0_used~0_113) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1111~0.base_23| 4)) (= v_~a$r_buff0_thd1~0_28 0) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 v_~__unbuffered_p0_EAX~0_17) (= 0 v_~__unbuffered_p2_EAX~0_14) (= (select .cse0 |v_ULTIMATE.start_main_~#t1111~0.base_23|) 0) (= 0 v_~a$r_buff1_thd2~0_21) (= 0 v_~a$w_buff1~0_25) (= 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_~#t1112~0.base=|v_ULTIMATE.start_main_~#t1112~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_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, #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, ~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_11, ULTIMATE.start_main_~#t1111~0.base=|v_ULTIMATE.start_main_~#t1111~0.base_23|, ~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|, ~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, ULTIMATE.start_main_~#t1113~0.offset=|v_ULTIMATE.start_main_~#t1113~0.offset_16|, ~y~0=v_~y~0_14, 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, ULTIMATE.start_main_~#t1112~0.offset=|v_ULTIMATE.start_main_~#t1112~0.offset_15|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_~#t1113~0.base=|v_ULTIMATE.start_main_~#t1113~0.base_20|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1111~0.offset=|v_ULTIMATE.start_main_~#t1111~0.offset_18|, ~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} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1112~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_#t~ite52, ~__unbuffered_p0_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, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1111~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t1113~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t1112~0.offset, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1113~0.base, #NULL.base, ULTIMATE.start_main_~#t1111~0.offset, ~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] because there is no mapped edge [2019-12-27 21:15:01,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L830-1-->L832: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1112~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1112~0.base_9|) |v_ULTIMATE.start_main_~#t1112~0.offset_7| 1)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t1112~0.offset_7|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1112~0.base_9| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1112~0.base_9| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1112~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1112~0.base_9|)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1112~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_~#t1112~0.base=|v_ULTIMATE.start_main_~#t1112~0.base_9|, ULTIMATE.start_main_~#t1112~0.offset=|v_ULTIMATE.start_main_~#t1112~0.offset_7|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1112~0.base, ULTIMATE.start_main_~#t1112~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 21:15:01,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L832-1-->L834: Formula: (and (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1113~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1113~0.base_9|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1113~0.base_9| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1113~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1113~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1113~0.base_9|) |v_ULTIMATE.start_main_~#t1113~0.offset_8| 2))) (= |v_ULTIMATE.start_main_~#t1113~0.offset_8| 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1113~0.base_9| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1113~0.offset=|v_ULTIMATE.start_main_~#t1113~0.offset_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1113~0.base=|v_ULTIMATE.start_main_~#t1113~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1113~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1113~0.base] because there is no mapped edge [2019-12-27 21:15:01,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L4-->L748: Formula: (and (= ~a$r_buff0_thd2~0_In1014206952 ~a$r_buff1_thd2~0_Out1014206952) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1014206952)) (= 1 ~a$r_buff0_thd1~0_Out1014206952) (= ~x~0_In1014206952 ~__unbuffered_p0_EAX~0_Out1014206952) (= ~a$r_buff1_thd3~0_Out1014206952 ~a$r_buff0_thd3~0_In1014206952) (= ~a$r_buff1_thd0~0_Out1014206952 ~a$r_buff0_thd0~0_In1014206952) (= ~a$r_buff0_thd1~0_In1014206952 ~a$r_buff1_thd1~0_Out1014206952)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1014206952, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1014206952, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1014206952, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1014206952, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1014206952, ~x~0=~x~0_In1014206952} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1014206952, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out1014206952, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out1014206952, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out1014206952, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out1014206952, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1014206952, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1014206952, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1014206952, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1014206952, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1014206952, ~x~0=~x~0_In1014206952} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~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] because there is no mapped edge [2019-12-27 21:15:01,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1366824203 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1366824203 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out-1366824203| |P1Thread1of1ForFork2_#t~ite10_Out-1366824203|))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1366824203| ~a$w_buff1~0_In-1366824203) (not .cse0) (not .cse1) .cse2) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-1366824203| ~a~0_In-1366824203) .cse2))) InVars {~a~0=~a~0_In-1366824203, ~a$w_buff1~0=~a$w_buff1~0_In-1366824203, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1366824203, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1366824203} OutVars{~a~0=~a~0_In-1366824203, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1366824203|, ~a$w_buff1~0=~a$w_buff1~0_In-1366824203, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1366824203, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1366824203|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1366824203} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 21:15:01,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L796-->L796-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1576807520 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1576807520 256)))) (or (= (mod ~a$w_buff0_used~0_In1576807520 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In1576807520 256)) .cse0) (and (= 0 (mod ~a$w_buff1_used~0_In1576807520 256)) .cse0))) .cse1 (= |P2Thread1of1ForFork0_#t~ite20_Out1576807520| ~a$w_buff0~0_In1576807520) (= |P2Thread1of1ForFork0_#t~ite20_Out1576807520| |P2Thread1of1ForFork0_#t~ite21_Out1576807520|)) (and (= |P2Thread1of1ForFork0_#t~ite20_In1576807520| |P2Thread1of1ForFork0_#t~ite20_Out1576807520|) (= |P2Thread1of1ForFork0_#t~ite21_Out1576807520| ~a$w_buff0~0_In1576807520) (not .cse1)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1576807520, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1576807520, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1576807520, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1576807520, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1576807520, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1576807520|, ~weak$$choice2~0=~weak$$choice2~0_In1576807520} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1576807520|, ~a$w_buff0~0=~a$w_buff0~0_In1576807520, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1576807520, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1576807520, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1576807520, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1576807520|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1576807520, ~weak$$choice2~0=~weak$$choice2~0_In1576807520} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 21:15:01,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In918415506 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In918415506 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out918415506| ~a$w_buff0_used~0_In918415506) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out918415506| 0) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In918415506, ~a$w_buff0_used~0=~a$w_buff0_used~0_In918415506} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In918415506, ~a$w_buff0_used~0=~a$w_buff0_used~0_In918415506, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out918415506|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 21:15:01,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-1679555998 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1679555998 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-1679555998 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1679555998 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out-1679555998| ~a$w_buff1_used~0_In-1679555998)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1679555998| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1679555998, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1679555998, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1679555998, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1679555998} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1679555998, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1679555998, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1679555998, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1679555998|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1679555998} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 21:15:01,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L797-->L797-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1741371342 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1741371342 256)))) (or (and (= 0 (mod ~a$w_buff1_used~0_In-1741371342 256)) .cse1) (= (mod ~a$w_buff0_used~0_In-1741371342 256) 0) (and (= (mod ~a$r_buff1_thd3~0_In-1741371342 256) 0) .cse1))) (= |P2Thread1of1ForFork0_#t~ite24_Out-1741371342| |P2Thread1of1ForFork0_#t~ite23_Out-1741371342|) (= ~a$w_buff1~0_In-1741371342 |P2Thread1of1ForFork0_#t~ite23_Out-1741371342|)) (and (= ~a$w_buff1~0_In-1741371342 |P2Thread1of1ForFork0_#t~ite24_Out-1741371342|) (= |P2Thread1of1ForFork0_#t~ite23_In-1741371342| |P2Thread1of1ForFork0_#t~ite23_Out-1741371342|) (not .cse0)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-1741371342, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1741371342|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1741371342, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1741371342, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1741371342, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1741371342, ~weak$$choice2~0=~weak$$choice2~0_In-1741371342} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-1741371342, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1741371342|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1741371342|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1741371342, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1741371342, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1741371342, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1741371342, ~weak$$choice2~0=~weak$$choice2~0_In-1741371342} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 21:15:01,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L798-->L798-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-371020964 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_In-371020964| |P2Thread1of1ForFork0_#t~ite26_Out-371020964|) (= |P2Thread1of1ForFork0_#t~ite27_Out-371020964| ~a$w_buff0_used~0_In-371020964) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite26_Out-371020964| ~a$w_buff0_used~0_In-371020964) .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out-371020964| |P2Thread1of1ForFork0_#t~ite27_Out-371020964|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-371020964 256) 0))) (or (= (mod ~a$w_buff0_used~0_In-371020964 256) 0) (and (= (mod ~a$r_buff1_thd3~0_In-371020964 256) 0) .cse1) (and (= (mod ~a$w_buff1_used~0_In-371020964 256) 0) .cse1)))))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-371020964|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-371020964, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-371020964, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-371020964, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-371020964, ~weak$$choice2~0=~weak$$choice2~0_In-371020964} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-371020964|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-371020964|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-371020964, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-371020964, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-371020964, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-371020964, ~weak$$choice2~0=~weak$$choice2~0_In-371020964} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 21:15:01,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-301799338 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-301799338 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In-301799338 |P1Thread1of1ForFork2_#t~ite13_Out-301799338|)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-301799338| 0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-301799338, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-301799338} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-301799338, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-301799338, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-301799338|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 21:15:01,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In1759495903 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In1759495903 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd2~0_In1759495903 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1759495903 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out1759495903| ~a$r_buff1_thd2~0_In1759495903)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1759495903|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1759495903, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1759495903, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1759495903, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1759495903} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1759495903, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1759495903, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1759495903, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1759495903, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1759495903|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 21:15:01,479 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:15:01,480 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:15:01,484 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:15:01,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In417863231 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In417863231 256)))) (or (and (or .cse0 .cse1) (= ~a~0_In417863231 |P2Thread1of1ForFork0_#t~ite38_Out417863231|)) (and (= ~a$w_buff1~0_In417863231 |P2Thread1of1ForFork0_#t~ite38_Out417863231|) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In417863231, ~a$w_buff1~0=~a$w_buff1~0_In417863231, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In417863231, ~a$w_buff1_used~0=~a$w_buff1_used~0_In417863231} OutVars{~a~0=~a~0_In417863231, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out417863231|, ~a$w_buff1~0=~a$w_buff1~0_In417863231, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In417863231, ~a$w_buff1_used~0=~a$w_buff1_used~0_In417863231} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 21:15:01,486 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:15:01,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-1013880800 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1013880800 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-1013880800| ~a$w_buff0_used~0_In-1013880800)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-1013880800| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1013880800, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1013880800} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1013880800|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1013880800, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1013880800} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 21:15:01,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-306469403 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-306469403 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-306469403 |P0Thread1of1ForFork1_#t~ite5_Out-306469403|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-306469403|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-306469403, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-306469403} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-306469403|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-306469403, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-306469403} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 21:15:01,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-478660939 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-478660939 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-478660939 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-478660939 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-478660939| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-478660939| ~a$w_buff1_used~0_In-478660939) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-478660939, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-478660939, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-478660939, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-478660939} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-478660939|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-478660939, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-478660939, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-478660939, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-478660939} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 21:15:01,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-783474273 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-783474273 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out-783474273)) (and (= ~a$r_buff0_thd1~0_In-783474273 ~a$r_buff0_thd1~0_Out-783474273) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-783474273, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-783474273} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-783474273|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-783474273, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-783474273} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:15:01,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1864284740 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1864284740 256))) (.cse3 (= (mod ~a$r_buff1_thd1~0_In1864284740 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In1864284740 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1864284740|)) (and (= ~a$r_buff1_thd1~0_In1864284740 |P0Thread1of1ForFork1_#t~ite8_Out1864284740|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1864284740, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1864284740, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1864284740, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1864284740} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1864284740|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1864284740, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1864284740, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1864284740, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1864284740} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 21:15:01,489 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:15:01,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd3~0_In-2050112792 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-2050112792 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-2050112792 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-2050112792 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out-2050112792| ~a$w_buff1_used~0_In-2050112792) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite41_Out-2050112792| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2050112792, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2050112792, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2050112792, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2050112792} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2050112792, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2050112792, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2050112792, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2050112792, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-2050112792|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 21:15:01,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1269261863 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1269261863 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1269261863|) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1269261863| ~a$r_buff0_thd3~0_In-1269261863) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1269261863, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1269261863} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1269261863, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1269261863, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1269261863|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 21:15:01,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In-197256964 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In-197256964 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-197256964 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-197256964 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-197256964|)) (and (or .cse2 .cse3) (= ~a$r_buff1_thd3~0_In-197256964 |P2Thread1of1ForFork0_#t~ite43_Out-197256964|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-197256964, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-197256964, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-197256964, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-197256964} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-197256964|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-197256964, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-197256964, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-197256964, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-197256964} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 21:15:01,494 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:15:01,494 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:15:01,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1204884978| |ULTIMATE.start_main_#t~ite48_Out1204884978|)) (.cse2 (= (mod ~a$w_buff1_used~0_In1204884978 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1204884978 256)))) (or (and .cse0 (= ~a~0_In1204884978 |ULTIMATE.start_main_#t~ite47_Out1204884978|) (or .cse1 .cse2)) (and .cse0 (= ~a$w_buff1~0_In1204884978 |ULTIMATE.start_main_#t~ite47_Out1204884978|) (not .cse2) (not .cse1)))) InVars {~a~0=~a~0_In1204884978, ~a$w_buff1~0=~a$w_buff1~0_In1204884978, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1204884978, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1204884978} OutVars{~a~0=~a~0_In1204884978, ~a$w_buff1~0=~a$w_buff1~0_In1204884978, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1204884978|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1204884978, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1204884978|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1204884978} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 21:15:01,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In1301991063 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1301991063 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1301991063| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1301991063| ~a$w_buff0_used~0_In1301991063)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1301991063, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1301991063} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1301991063, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1301991063|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1301991063} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 21:15:01,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In1168462088 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1168462088 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1168462088 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1168462088 256)))) (or (and (= ~a$w_buff1_used~0_In1168462088 |ULTIMATE.start_main_#t~ite50_Out1168462088|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite50_Out1168462088|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1168462088, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1168462088, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1168462088, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1168462088} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1168462088|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1168462088, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1168462088, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1168462088, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1168462088} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 21:15:01,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-688157047 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-688157047 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-688157047|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd0~0_In-688157047 |ULTIMATE.start_main_#t~ite51_Out-688157047|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-688157047, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-688157047} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-688157047|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-688157047, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-688157047} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 21:15:01,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In-1376675690 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-1376675690 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1376675690 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1376675690 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1376675690| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite52_Out-1376675690| ~a$r_buff1_thd0~0_In-1376675690)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1376675690, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1376675690, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1376675690, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1376675690} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1376675690|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1376675690, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1376675690, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1376675690, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1376675690} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 21:15:01,500 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) (= 2 v_~y~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= 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_p0_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, 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, ~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, ~y~0=v_~y~0_8, 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:15:01,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:15:01 BasicIcfg [2019-12-27 21:15:01,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:15:01,631 INFO L168 Benchmark]: Toolchain (without parser) took 120732.99 ms. Allocated memory was 135.8 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 97.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 21:15:01,635 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 135.8 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 21:15:01,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 867.37 ms. Allocated memory was 135.8 MB in the beginning and 200.8 MB in the end (delta: 65.0 MB). Free memory was 97.4 MB in the beginning and 155.4 MB in the end (delta: -58.1 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:15:01,635 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.54 ms. Allocated memory is still 200.8 MB. Free memory was 154.7 MB in the beginning and 152.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:15:01,638 INFO L168 Benchmark]: Boogie Preprocessor took 39.89 ms. Allocated memory is still 200.8 MB. Free memory was 152.6 MB in the beginning and 149.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:15:01,638 INFO L168 Benchmark]: RCFGBuilder took 808.22 ms. Allocated memory is still 200.8 MB. Free memory was 149.7 MB in the beginning and 99.8 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:15:01,639 INFO L168 Benchmark]: TraceAbstraction took 118942.43 ms. Allocated memory was 200.8 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 99.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 21:15:01,644 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.24 ms. Allocated memory is still 135.8 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 867.37 ms. Allocated memory was 135.8 MB in the beginning and 200.8 MB in the end (delta: 65.0 MB). Free memory was 97.4 MB in the beginning and 155.4 MB in the end (delta: -58.1 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.54 ms. Allocated memory is still 200.8 MB. Free memory was 154.7 MB in the beginning and 152.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.89 ms. Allocated memory is still 200.8 MB. Free memory was 152.6 MB in the beginning and 149.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 808.22 ms. Allocated memory is still 200.8 MB. Free memory was 149.7 MB in the beginning and 99.8 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 118942.43 ms. Allocated memory was 200.8 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 99.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 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(&t1111, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t1112, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t1113, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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 = 1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, y=1, 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_p0_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=1, y=1, z=0] [L782] 3 y = 2 [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_p0_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=1, y=2, 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_p0_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=1, y=2, 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_p0_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=1, y=2, 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_p0_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=1, y=2, 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_p0_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=1, y=2, 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_p0_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=1, y=2, 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_p0_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=1, y=2, 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_p0_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=1, y=2, 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: 118.5s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 52.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7000 SDtfs, 12510 SDslu, 19623 SDs, 0 SdLazy, 20337 SolverSat, 912 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 675 GetRequests, 159 SyntacticMatches, 59 SemanticMatches, 457 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6412 ImplicationChecksByTransitivity, 12.9s 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: 36.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 450622 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1209 NumberOfCodeBlocks, 1209 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1114 ConstructedInterpolants, 0 QuantifiedInterpolants, 179867 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...