/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe026_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:55:59,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:55:59,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:55:59,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:55:59,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:55:59,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:55:59,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:55:59,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:55:59,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:55:59,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:55:59,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:55:59,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:55:59,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:55:59,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:55:59,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:55:59,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:55:59,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:55:59,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:55:59,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:55:59,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:55:59,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:55:59,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:55:59,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:55:59,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:55:59,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:55:59,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:55:59,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:55:59,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:55:59,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:55:59,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:55:59,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:55:59,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:55:59,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:55:59,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:55:59,634 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:55:59,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:55:59,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:55:59,635 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:55:59,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:55:59,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:55:59,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:55:59,637 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:55:59,651 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:55:59,652 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:55:59,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:55:59,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:55:59,653 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:55:59,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:55:59,654 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:55:59,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:55:59,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:55:59,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:55:59,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:55:59,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:55:59,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:55:59,655 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:55:59,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:55:59,655 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:55:59,656 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:55:59,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:55:59,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:55:59,656 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:55:59,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:55:59,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:55:59,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:55:59,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:55:59,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:55:59,658 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:55:59,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:55:59,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:55:59,658 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:56:00,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:56:00,047 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:56:00,051 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:56:00,052 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:56:00,053 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:56:00,054 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe026_power.opt.i [2019-12-18 18:56:00,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f836332c0/003abfb4afad4eac93b281f2b1a51d7e/FLAGb7d25018c [2019-12-18 18:56:00,638 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:56:00,639 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_power.opt.i [2019-12-18 18:56:00,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f836332c0/003abfb4afad4eac93b281f2b1a51d7e/FLAGb7d25018c [2019-12-18 18:56:00,943 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f836332c0/003abfb4afad4eac93b281f2b1a51d7e [2019-12-18 18:56:00,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:56:00,957 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:56:00,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:56:00,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:56:00,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:56:00,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:56:00" (1/1) ... [2019-12-18 18:56:00,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e76b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:56:00, skipping insertion in model container [2019-12-18 18:56:00,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:56:00" (1/1) ... [2019-12-18 18:56:00,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:56:01,029 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:56:01,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:56:01,569 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:56:01,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:56:01,726 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:56:01,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:56:01 WrapperNode [2019-12-18 18:56:01,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:56:01,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:56:01,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:56:01,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:56:01,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:56:01" (1/1) ... [2019-12-18 18:56:01,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:56:01" (1/1) ... [2019-12-18 18:56:01,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:56:01,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:56:01,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:56:01,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:56:01,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:56:01" (1/1) ... [2019-12-18 18:56:01,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:56:01" (1/1) ... [2019-12-18 18:56:01,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:56:01" (1/1) ... [2019-12-18 18:56:01,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:56:01" (1/1) ... [2019-12-18 18:56:01,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:56:01" (1/1) ... [2019-12-18 18:56:01,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:56:01" (1/1) ... [2019-12-18 18:56:01,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:56:01" (1/1) ... [2019-12-18 18:56:01,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:56:01,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:56:01,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:56:01,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:56:01,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:56: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-18 18:56:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:56:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:56:01,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:56:01,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:56:01,926 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:56:01,926 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:56:01,927 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:56:01,927 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:56:01,927 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 18:56:01,927 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 18:56:01,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:56:01,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:56:01,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:56:01,931 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:56:02,679 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:56:02,679 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:56:02,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:56:02 BoogieIcfgContainer [2019-12-18 18:56:02,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:56:02,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:56:02,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:56:02,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:56:02,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:56:00" (1/3) ... [2019-12-18 18:56:02,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3f891e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:56:02, skipping insertion in model container [2019-12-18 18:56:02,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:56:01" (2/3) ... [2019-12-18 18:56:02,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3f891e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:56:02, skipping insertion in model container [2019-12-18 18:56:02,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:56:02" (3/3) ... [2019-12-18 18:56:02,689 INFO L109 eAbstractionObserver]: Analyzing ICFG safe026_power.opt.i [2019-12-18 18:56:02,699 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:56:02,700 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:56:02,708 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:56:02,709 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:56:02,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,751 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,752 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,752 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,752 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,753 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,761 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,761 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,787 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,787 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,816 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,817 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,817 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,819 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,820 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,824 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,826 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:56:02,844 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 18:56:02,861 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:56:02,861 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:56:02,861 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:56:02,861 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:56:02,861 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:56:02,861 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:56:02,862 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:56:02,862 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:56:02,880 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 18:56:02,881 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 18:56:02,970 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 18:56:02,970 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:56:02,989 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 18:56:03,015 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 18:56:03,069 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 18:56:03,070 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:56:03,091 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 18:56:03,112 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 18:56:03,113 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:56:03,777 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-12-18 18:56:07,962 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 18:56:08,076 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 18:56:08,430 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 18:56:08,560 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 18:56:08,584 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78269 [2019-12-18 18:56:08,584 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 18:56:08,588 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 103 transitions [2019-12-18 18:56:25,328 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109594 states. [2019-12-18 18:56:25,330 INFO L276 IsEmpty]: Start isEmpty. Operand 109594 states. [2019-12-18 18:56:25,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 18:56:25,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:56:25,337 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 18:56:25,337 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-18 18:56:25,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:56:25,342 INFO L82 PathProgramCache]: Analyzing trace with hash 909914, now seen corresponding path program 1 times [2019-12-18 18:56:25,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:56:25,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092640645] [2019-12-18 18:56:25,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:56:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:56:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:56:25,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092640645] [2019-12-18 18:56:25,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:56:25,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:56:25,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804755172] [2019-12-18 18:56:25,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:56:25,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:56:25,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:56:25,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:56:25,573 INFO L87 Difference]: Start difference. First operand 109594 states. Second operand 3 states. [2019-12-18 18:56:29,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:56:29,128 INFO L93 Difference]: Finished difference Result 108680 states and 463562 transitions. [2019-12-18 18:56:29,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:56:29,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 18:56:29,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:56:29,866 INFO L225 Difference]: With dead ends: 108680 [2019-12-18 18:56:29,866 INFO L226 Difference]: Without dead ends: 102440 [2019-12-18 18:56:29,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:56:34,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102440 states. [2019-12-18 18:56:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102440 to 102440. [2019-12-18 18:56:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102440 states. [2019-12-18 18:56:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102440 states to 102440 states and 436366 transitions. [2019-12-18 18:56:40,089 INFO L78 Accepts]: Start accepts. Automaton has 102440 states and 436366 transitions. Word has length 3 [2019-12-18 18:56:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:56:40,090 INFO L462 AbstractCegarLoop]: Abstraction has 102440 states and 436366 transitions. [2019-12-18 18:56:40,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:56:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand 102440 states and 436366 transitions. [2019-12-18 18:56:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:56:40,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:56:40,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:56:40,095 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-18 18:56:40,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:56:40,096 INFO L82 PathProgramCache]: Analyzing trace with hash -975068220, now seen corresponding path program 1 times [2019-12-18 18:56:40,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:56:40,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423450094] [2019-12-18 18:56:40,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:56:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:56:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:56:40,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423450094] [2019-12-18 18:56:40,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:56:40,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:56:40,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610196092] [2019-12-18 18:56:40,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:56:40,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:56:40,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:56:40,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:56:40,285 INFO L87 Difference]: Start difference. First operand 102440 states and 436366 transitions. Second operand 4 states. [2019-12-18 18:56:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:56:45,142 INFO L93 Difference]: Finished difference Result 163248 states and 665679 transitions. [2019-12-18 18:56:45,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:56:45,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:56:45,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:56:45,636 INFO L225 Difference]: With dead ends: 163248 [2019-12-18 18:56:45,636 INFO L226 Difference]: Without dead ends: 163199 [2019-12-18 18:56:45,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:56:50,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163199 states. [2019-12-18 18:56:54,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163199 to 148639. [2019-12-18 18:56:54,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148639 states. [2019-12-18 18:56:54,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148639 states to 148639 states and 614105 transitions. [2019-12-18 18:56:54,732 INFO L78 Accepts]: Start accepts. Automaton has 148639 states and 614105 transitions. Word has length 11 [2019-12-18 18:56:54,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:56:54,733 INFO L462 AbstractCegarLoop]: Abstraction has 148639 states and 614105 transitions. [2019-12-18 18:56:54,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:56:54,733 INFO L276 IsEmpty]: Start isEmpty. Operand 148639 states and 614105 transitions. [2019-12-18 18:56:54,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:56:54,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:56:54,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:56:54,741 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-18 18:56:54,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:56:54,742 INFO L82 PathProgramCache]: Analyzing trace with hash -112330344, now seen corresponding path program 1 times [2019-12-18 18:56:54,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:56:54,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440684215] [2019-12-18 18:56:54,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:56:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:56:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:56:54,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440684215] [2019-12-18 18:56:54,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:56:54,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:56:54,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002643669] [2019-12-18 18:56:54,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:56:54,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:56:54,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:56:54,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:56:54,866 INFO L87 Difference]: Start difference. First operand 148639 states and 614105 transitions. Second operand 4 states. [2019-12-18 18:56:59,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:56:59,672 INFO L93 Difference]: Finished difference Result 43706 states and 149507 transitions. [2019-12-18 18:56:59,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:56:59,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 18:56:59,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:56:59,793 INFO L225 Difference]: With dead ends: 43706 [2019-12-18 18:56:59,793 INFO L226 Difference]: Without dead ends: 33577 [2019-12-18 18:56:59,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:57:00,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33577 states. [2019-12-18 18:57:00,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33577 to 33481. [2019-12-18 18:57:00,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33481 states. [2019-12-18 18:57:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33481 states to 33481 states and 108822 transitions. [2019-12-18 18:57:00,515 INFO L78 Accepts]: Start accepts. Automaton has 33481 states and 108822 transitions. Word has length 13 [2019-12-18 18:57:00,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:00,516 INFO L462 AbstractCegarLoop]: Abstraction has 33481 states and 108822 transitions. [2019-12-18 18:57:00,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:57:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 33481 states and 108822 transitions. [2019-12-18 18:57:00,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 18:57:00,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:00,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:57:00,519 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-18 18:57:00,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:00,519 INFO L82 PathProgramCache]: Analyzing trace with hash -790185689, now seen corresponding path program 1 times [2019-12-18 18:57:00,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:00,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001606785] [2019-12-18 18:57:00,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:00,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:00,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001606785] [2019-12-18 18:57:00,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:00,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:57:00,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715621721] [2019-12-18 18:57:00,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:57:00,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:00,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:57:00,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:57:00,654 INFO L87 Difference]: Start difference. First operand 33481 states and 108822 transitions. Second operand 5 states. [2019-12-18 18:57:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:01,113 INFO L93 Difference]: Finished difference Result 45175 states and 144711 transitions. [2019-12-18 18:57:01,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:57:01,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 18:57:01,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:01,194 INFO L225 Difference]: With dead ends: 45175 [2019-12-18 18:57:01,195 INFO L226 Difference]: Without dead ends: 45175 [2019-12-18 18:57:01,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:57:01,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45175 states. [2019-12-18 18:57:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45175 to 38347. [2019-12-18 18:57:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38347 states. [2019-12-18 18:57:02,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38347 states to 38347 states and 123865 transitions. [2019-12-18 18:57:02,293 INFO L78 Accepts]: Start accepts. Automaton has 38347 states and 123865 transitions. Word has length 16 [2019-12-18 18:57:02,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:02,293 INFO L462 AbstractCegarLoop]: Abstraction has 38347 states and 123865 transitions. [2019-12-18 18:57:02,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:57:02,294 INFO L276 IsEmpty]: Start isEmpty. Operand 38347 states and 123865 transitions. [2019-12-18 18:57:02,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 18:57:02,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:02,305 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-18 18:57:02,305 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-18 18:57:02,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:02,305 INFO L82 PathProgramCache]: Analyzing trace with hash 2079194331, now seen corresponding path program 1 times [2019-12-18 18:57:02,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:02,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782872962] [2019-12-18 18:57:02,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:02,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782872962] [2019-12-18 18:57:02,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:02,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:57:02,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64729537] [2019-12-18 18:57:02,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:57:02,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:02,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:57:02,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:57:02,447 INFO L87 Difference]: Start difference. First operand 38347 states and 123865 transitions. Second operand 6 states. [2019-12-18 18:57:03,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:03,378 INFO L93 Difference]: Finished difference Result 58112 states and 182585 transitions. [2019-12-18 18:57:03,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:57:03,379 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 18:57:03,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:03,480 INFO L225 Difference]: With dead ends: 58112 [2019-12-18 18:57:03,480 INFO L226 Difference]: Without dead ends: 58056 [2019-12-18 18:57:03,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:57:04,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58056 states. [2019-12-18 18:57:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58056 to 38947. [2019-12-18 18:57:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38947 states. [2019-12-18 18:57:04,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38947 states to 38947 states and 124912 transitions. [2019-12-18 18:57:04,674 INFO L78 Accepts]: Start accepts. Automaton has 38947 states and 124912 transitions. Word has length 22 [2019-12-18 18:57:04,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:04,675 INFO L462 AbstractCegarLoop]: Abstraction has 38947 states and 124912 transitions. [2019-12-18 18:57:04,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:57:04,675 INFO L276 IsEmpty]: Start isEmpty. Operand 38947 states and 124912 transitions. [2019-12-18 18:57:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:57:04,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:04,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:57:04,689 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-18 18:57:04,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:04,690 INFO L82 PathProgramCache]: Analyzing trace with hash -356343789, now seen corresponding path program 1 times [2019-12-18 18:57:04,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:04,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543361984] [2019-12-18 18:57:04,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:04,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543361984] [2019-12-18 18:57:04,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:04,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:57:04,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175755474] [2019-12-18 18:57:04,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:57:04,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:04,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:57:04,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:57:04,781 INFO L87 Difference]: Start difference. First operand 38947 states and 124912 transitions. Second operand 5 states. [2019-12-18 18:57:04,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:04,914 INFO L93 Difference]: Finished difference Result 17807 states and 53973 transitions. [2019-12-18 18:57:04,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:57:04,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 18:57:04,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:04,945 INFO L225 Difference]: With dead ends: 17807 [2019-12-18 18:57:04,945 INFO L226 Difference]: Without dead ends: 15537 [2019-12-18 18:57:04,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:57:05,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15537 states. [2019-12-18 18:57:05,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15537 to 15208. [2019-12-18 18:57:05,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15208 states. [2019-12-18 18:57:05,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15208 states to 15208 states and 46078 transitions. [2019-12-18 18:57:05,229 INFO L78 Accepts]: Start accepts. Automaton has 15208 states and 46078 transitions. Word has length 25 [2019-12-18 18:57:05,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:05,230 INFO L462 AbstractCegarLoop]: Abstraction has 15208 states and 46078 transitions. [2019-12-18 18:57:05,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:57:05,230 INFO L276 IsEmpty]: Start isEmpty. Operand 15208 states and 46078 transitions. [2019-12-18 18:57:05,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 18:57:05,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:05,244 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-18 18:57:05,245 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-18 18:57:05,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:05,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1041381309, now seen corresponding path program 1 times [2019-12-18 18:57:05,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:05,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92585615] [2019-12-18 18:57:05,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:05,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92585615] [2019-12-18 18:57:05,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:05,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:57:05,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518524898] [2019-12-18 18:57:05,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:57:05,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:05,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:57:05,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:57:05,375 INFO L87 Difference]: Start difference. First operand 15208 states and 46078 transitions. Second operand 7 states. [2019-12-18 18:57:06,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:06,190 INFO L93 Difference]: Finished difference Result 20223 states and 59927 transitions. [2019-12-18 18:57:06,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:57:06,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-12-18 18:57:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:06,217 INFO L225 Difference]: With dead ends: 20223 [2019-12-18 18:57:06,218 INFO L226 Difference]: Without dead ends: 19969 [2019-12-18 18:57:06,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:57:06,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19969 states. [2019-12-18 18:57:06,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19969 to 17340. [2019-12-18 18:57:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17340 states. [2019-12-18 18:57:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17340 states to 17340 states and 51993 transitions. [2019-12-18 18:57:06,631 INFO L78 Accepts]: Start accepts. Automaton has 17340 states and 51993 transitions. Word has length 27 [2019-12-18 18:57:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:06,632 INFO L462 AbstractCegarLoop]: Abstraction has 17340 states and 51993 transitions. [2019-12-18 18:57:06,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:57:06,632 INFO L276 IsEmpty]: Start isEmpty. Operand 17340 states and 51993 transitions. [2019-12-18 18:57:06,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 18:57:06,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:06,648 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-18 18:57:06,648 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-18 18:57:06,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:06,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1993081713, now seen corresponding path program 1 times [2019-12-18 18:57:06,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:06,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289548124] [2019-12-18 18:57:06,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:06,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289548124] [2019-12-18 18:57:06,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:06,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:57:06,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498512038] [2019-12-18 18:57:06,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:57:06,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:06,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:57:06,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:57:06,796 INFO L87 Difference]: Start difference. First operand 17340 states and 51993 transitions. Second operand 7 states. [2019-12-18 18:57:07,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:07,977 INFO L93 Difference]: Finished difference Result 24233 states and 70715 transitions. [2019-12-18 18:57:07,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 18:57:07,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 18:57:07,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:08,011 INFO L225 Difference]: With dead ends: 24233 [2019-12-18 18:57:08,011 INFO L226 Difference]: Without dead ends: 23546 [2019-12-18 18:57:08,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 18:57:08,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23546 states. [2019-12-18 18:57:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23546 to 16133. [2019-12-18 18:57:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16133 states. [2019-12-18 18:57:08,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16133 states to 16133 states and 48316 transitions. [2019-12-18 18:57:08,285 INFO L78 Accepts]: Start accepts. Automaton has 16133 states and 48316 transitions. Word has length 33 [2019-12-18 18:57:08,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:08,286 INFO L462 AbstractCegarLoop]: Abstraction has 16133 states and 48316 transitions. [2019-12-18 18:57:08,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:57:08,286 INFO L276 IsEmpty]: Start isEmpty. Operand 16133 states and 48316 transitions. [2019-12-18 18:57:08,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 18:57:08,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:08,305 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-18 18:57:08,305 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-18 18:57:08,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:08,305 INFO L82 PathProgramCache]: Analyzing trace with hash 2090975987, now seen corresponding path program 1 times [2019-12-18 18:57:08,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:08,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561965778] [2019-12-18 18:57:08,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:08,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561965778] [2019-12-18 18:57:08,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:08,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:57:08,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764119470] [2019-12-18 18:57:08,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:57:08,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:08,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:57:08,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:57:08,374 INFO L87 Difference]: Start difference. First operand 16133 states and 48316 transitions. Second operand 3 states. [2019-12-18 18:57:08,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:08,430 INFO L93 Difference]: Finished difference Result 16132 states and 48314 transitions. [2019-12-18 18:57:08,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:57:08,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 18:57:08,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:08,454 INFO L225 Difference]: With dead ends: 16132 [2019-12-18 18:57:08,455 INFO L226 Difference]: Without dead ends: 16132 [2019-12-18 18:57:08,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:57:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16132 states. [2019-12-18 18:57:08,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16132 to 16132. [2019-12-18 18:57:08,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16132 states. [2019-12-18 18:57:08,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16132 states to 16132 states and 48314 transitions. [2019-12-18 18:57:08,691 INFO L78 Accepts]: Start accepts. Automaton has 16132 states and 48314 transitions. Word has length 39 [2019-12-18 18:57:08,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:08,692 INFO L462 AbstractCegarLoop]: Abstraction has 16132 states and 48314 transitions. [2019-12-18 18:57:08,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:57:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand 16132 states and 48314 transitions. [2019-12-18 18:57:08,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 18:57:08,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:08,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:57:08,713 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-18 18:57:08,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:08,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1209723158, now seen corresponding path program 1 times [2019-12-18 18:57:08,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:08,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832653954] [2019-12-18 18:57:08,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:08,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832653954] [2019-12-18 18:57:08,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:08,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:57:08,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705562443] [2019-12-18 18:57:08,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:57:08,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:08,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:57:08,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:57:08,787 INFO L87 Difference]: Start difference. First operand 16132 states and 48314 transitions. Second operand 5 states. [2019-12-18 18:57:09,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:09,567 INFO L93 Difference]: Finished difference Result 23123 states and 68845 transitions. [2019-12-18 18:57:09,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:57:09,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 18:57:09,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:09,600 INFO L225 Difference]: With dead ends: 23123 [2019-12-18 18:57:09,600 INFO L226 Difference]: Without dead ends: 23123 [2019-12-18 18:57:09,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:57:09,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23123 states. [2019-12-18 18:57:09,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23123 to 21537. [2019-12-18 18:57:09,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21537 states. [2019-12-18 18:57:09,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21537 states to 21537 states and 64517 transitions. [2019-12-18 18:57:09,922 INFO L78 Accepts]: Start accepts. Automaton has 21537 states and 64517 transitions. Word has length 40 [2019-12-18 18:57:09,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:09,923 INFO L462 AbstractCegarLoop]: Abstraction has 21537 states and 64517 transitions. [2019-12-18 18:57:09,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:57:09,923 INFO L276 IsEmpty]: Start isEmpty. Operand 21537 states and 64517 transitions. [2019-12-18 18:57:09,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 18:57:09,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:09,949 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:57:09,949 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-18 18:57:09,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:09,950 INFO L82 PathProgramCache]: Analyzing trace with hash -739159160, now seen corresponding path program 2 times [2019-12-18 18:57:09,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:09,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201451138] [2019-12-18 18:57:09,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:10,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201451138] [2019-12-18 18:57:10,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:10,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:57:10,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061840720] [2019-12-18 18:57:10,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:57:10,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:10,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:57:10,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:57:10,032 INFO L87 Difference]: Start difference. First operand 21537 states and 64517 transitions. Second operand 3 states. [2019-12-18 18:57:10,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:10,134 INFO L93 Difference]: Finished difference Result 21537 states and 63844 transitions. [2019-12-18 18:57:10,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:57:10,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 18:57:10,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:10,170 INFO L225 Difference]: With dead ends: 21537 [2019-12-18 18:57:10,170 INFO L226 Difference]: Without dead ends: 21537 [2019-12-18 18:57:10,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:57:10,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21537 states. [2019-12-18 18:57:10,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21537 to 21421. [2019-12-18 18:57:10,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21421 states. [2019-12-18 18:57:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21421 states to 21421 states and 63522 transitions. [2019-12-18 18:57:10,486 INFO L78 Accepts]: Start accepts. Automaton has 21421 states and 63522 transitions. Word has length 40 [2019-12-18 18:57:10,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:10,486 INFO L462 AbstractCegarLoop]: Abstraction has 21421 states and 63522 transitions. [2019-12-18 18:57:10,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:57:10,486 INFO L276 IsEmpty]: Start isEmpty. Operand 21421 states and 63522 transitions. [2019-12-18 18:57:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 18:57:10,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:10,508 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] [2019-12-18 18:57:10,508 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-18 18:57:10,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:10,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1835008453, now seen corresponding path program 1 times [2019-12-18 18:57:10,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:10,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76940879] [2019-12-18 18:57:10,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:10,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-18 18:57:10,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76940879] [2019-12-18 18:57:10,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:10,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:57:10,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678157558] [2019-12-18 18:57:10,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:57:10,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:10,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:57:10,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:57:10,601 INFO L87 Difference]: Start difference. First operand 21421 states and 63522 transitions. Second operand 3 states. [2019-12-18 18:57:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:10,692 INFO L93 Difference]: Finished difference Result 21346 states and 63289 transitions. [2019-12-18 18:57:10,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:57:10,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 18:57:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:10,721 INFO L225 Difference]: With dead ends: 21346 [2019-12-18 18:57:10,721 INFO L226 Difference]: Without dead ends: 21346 [2019-12-18 18:57:10,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:57:10,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21346 states. [2019-12-18 18:57:10,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21346 to 17850. [2019-12-18 18:57:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17850 states. [2019-12-18 18:57:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17850 states to 17850 states and 53557 transitions. [2019-12-18 18:57:11,014 INFO L78 Accepts]: Start accepts. Automaton has 17850 states and 53557 transitions. Word has length 41 [2019-12-18 18:57:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:11,015 INFO L462 AbstractCegarLoop]: Abstraction has 17850 states and 53557 transitions. [2019-12-18 18:57:11,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:57:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 17850 states and 53557 transitions. [2019-12-18 18:57:11,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 18:57:11,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:11,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:57:11,040 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-18 18:57:11,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:11,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1386848900, now seen corresponding path program 1 times [2019-12-18 18:57:11,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:11,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606735880] [2019-12-18 18:57:11,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:11,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606735880] [2019-12-18 18:57:11,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:11,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:57:11,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058616532] [2019-12-18 18:57:11,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:57:11,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:11,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:57:11,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:57:11,123 INFO L87 Difference]: Start difference. First operand 17850 states and 53557 transitions. Second operand 6 states. [2019-12-18 18:57:11,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:11,405 INFO L93 Difference]: Finished difference Result 16802 states and 51226 transitions. [2019-12-18 18:57:11,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:57:11,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 18:57:11,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:11,427 INFO L225 Difference]: With dead ends: 16802 [2019-12-18 18:57:11,427 INFO L226 Difference]: Without dead ends: 16672 [2019-12-18 18:57:11,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:57:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16672 states. [2019-12-18 18:57:11,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16672 to 16672. [2019-12-18 18:57:11,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16672 states. [2019-12-18 18:57:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16672 states to 16672 states and 50949 transitions. [2019-12-18 18:57:11,659 INFO L78 Accepts]: Start accepts. Automaton has 16672 states and 50949 transitions. Word has length 42 [2019-12-18 18:57:11,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:11,660 INFO L462 AbstractCegarLoop]: Abstraction has 16672 states and 50949 transitions. [2019-12-18 18:57:11,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:57:11,660 INFO L276 IsEmpty]: Start isEmpty. Operand 16672 states and 50949 transitions. [2019-12-18 18:57:11,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:57:11,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:11,681 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-18 18:57:11,682 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-18 18:57:11,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:11,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1128251409, now seen corresponding path program 1 times [2019-12-18 18:57:11,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:11,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331966017] [2019-12-18 18:57:11,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:11,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331966017] [2019-12-18 18:57:11,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:11,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:57:11,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674372749] [2019-12-18 18:57:11,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:57:11,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:11,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:57:11,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:57:11,732 INFO L87 Difference]: Start difference. First operand 16672 states and 50949 transitions. Second operand 3 states. [2019-12-18 18:57:11,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:11,834 INFO L93 Difference]: Finished difference Result 23766 states and 72975 transitions. [2019-12-18 18:57:11,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:57:11,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 18:57:11,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:11,865 INFO L225 Difference]: With dead ends: 23766 [2019-12-18 18:57:11,865 INFO L226 Difference]: Without dead ends: 23766 [2019-12-18 18:57:11,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:57:11,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23766 states. [2019-12-18 18:57:12,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23766 to 18908. [2019-12-18 18:57:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18908 states. [2019-12-18 18:57:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18908 states to 18908 states and 58542 transitions. [2019-12-18 18:57:12,170 INFO L78 Accepts]: Start accepts. Automaton has 18908 states and 58542 transitions. Word has length 66 [2019-12-18 18:57:12,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:12,170 INFO L462 AbstractCegarLoop]: Abstraction has 18908 states and 58542 transitions. [2019-12-18 18:57:12,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:57:12,170 INFO L276 IsEmpty]: Start isEmpty. Operand 18908 states and 58542 transitions. [2019-12-18 18:57:12,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:57:12,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:12,189 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-18 18:57:12,190 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-18 18:57:12,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:12,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1486247926, now seen corresponding path program 1 times [2019-12-18 18:57:12,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:12,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845949212] [2019-12-18 18:57:12,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:12,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845949212] [2019-12-18 18:57:12,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:12,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:57:12,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599130067] [2019-12-18 18:57:12,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:57:12,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:12,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:57:12,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:57:12,237 INFO L87 Difference]: Start difference. First operand 18908 states and 58542 transitions. Second operand 3 states. [2019-12-18 18:57:12,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:12,367 INFO L93 Difference]: Finished difference Result 22628 states and 67954 transitions. [2019-12-18 18:57:12,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:57:12,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 18:57:12,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:12,404 INFO L225 Difference]: With dead ends: 22628 [2019-12-18 18:57:12,405 INFO L226 Difference]: Without dead ends: 22628 [2019-12-18 18:57:12,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:57:12,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22628 states. [2019-12-18 18:57:12,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22628 to 17579. [2019-12-18 18:57:12,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17579 states. [2019-12-18 18:57:12,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17579 states to 17579 states and 52993 transitions. [2019-12-18 18:57:12,718 INFO L78 Accepts]: Start accepts. Automaton has 17579 states and 52993 transitions. Word has length 66 [2019-12-18 18:57:12,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:12,719 INFO L462 AbstractCegarLoop]: Abstraction has 17579 states and 52993 transitions. [2019-12-18 18:57:12,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:57:12,719 INFO L276 IsEmpty]: Start isEmpty. Operand 17579 states and 52993 transitions. [2019-12-18 18:57:12,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:57:12,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:12,736 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-18 18:57:12,736 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-18 18:57:12,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:12,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2105019115, now seen corresponding path program 1 times [2019-12-18 18:57:12,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:12,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917208880] [2019-12-18 18:57:12,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:12,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917208880] [2019-12-18 18:57:12,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:12,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:57:12,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025726848] [2019-12-18 18:57:12,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:57:12,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:12,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:57:12,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:57:12,831 INFO L87 Difference]: Start difference. First operand 17579 states and 52993 transitions. Second operand 7 states. [2019-12-18 18:57:13,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:13,487 INFO L93 Difference]: Finished difference Result 51897 states and 154354 transitions. [2019-12-18 18:57:13,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:57:13,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 18:57:13,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:13,535 INFO L225 Difference]: With dead ends: 51897 [2019-12-18 18:57:13,535 INFO L226 Difference]: Without dead ends: 37071 [2019-12-18 18:57:13,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:57:13,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37071 states. [2019-12-18 18:57:13,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37071 to 21234. [2019-12-18 18:57:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21234 states. [2019-12-18 18:57:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21234 states to 21234 states and 63310 transitions. [2019-12-18 18:57:13,977 INFO L78 Accepts]: Start accepts. Automaton has 21234 states and 63310 transitions. Word has length 66 [2019-12-18 18:57:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:13,977 INFO L462 AbstractCegarLoop]: Abstraction has 21234 states and 63310 transitions. [2019-12-18 18:57:13,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:57:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 21234 states and 63310 transitions. [2019-12-18 18:57:14,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:57:14,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:14,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:57:14,002 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-18 18:57:14,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:14,003 INFO L82 PathProgramCache]: Analyzing trace with hash 659069437, now seen corresponding path program 2 times [2019-12-18 18:57:14,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:14,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676285976] [2019-12-18 18:57:14,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:14,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676285976] [2019-12-18 18:57:14,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:14,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:57:14,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746179736] [2019-12-18 18:57:14,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 18:57:14,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:14,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 18:57:14,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:57:14,131 INFO L87 Difference]: Start difference. First operand 21234 states and 63310 transitions. Second operand 8 states. [2019-12-18 18:57:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:16,420 INFO L93 Difference]: Finished difference Result 32742 states and 95766 transitions. [2019-12-18 18:57:16,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 18:57:16,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 18:57:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:16,465 INFO L225 Difference]: With dead ends: 32742 [2019-12-18 18:57:16,465 INFO L226 Difference]: Without dead ends: 32470 [2019-12-18 18:57:16,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-18 18:57:16,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32470 states. [2019-12-18 18:57:16,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32470 to 20332. [2019-12-18 18:57:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20332 states. [2019-12-18 18:57:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20332 states to 20332 states and 60813 transitions. [2019-12-18 18:57:16,855 INFO L78 Accepts]: Start accepts. Automaton has 20332 states and 60813 transitions. Word has length 66 [2019-12-18 18:57:16,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:16,855 INFO L462 AbstractCegarLoop]: Abstraction has 20332 states and 60813 transitions. [2019-12-18 18:57:16,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 18:57:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand 20332 states and 60813 transitions. [2019-12-18 18:57:16,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:57:16,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:16,877 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-18 18:57:16,877 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-18 18:57:16,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:16,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1259142147, now seen corresponding path program 3 times [2019-12-18 18:57:16,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:16,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240822587] [2019-12-18 18:57:16,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:17,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:17,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240822587] [2019-12-18 18:57:17,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:17,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:57:17,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006167328] [2019-12-18 18:57:17,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 18:57:17,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:17,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 18:57:17,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:57:17,482 INFO L87 Difference]: Start difference. First operand 20332 states and 60813 transitions. Second operand 13 states. [2019-12-18 18:57:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:21,311 INFO L93 Difference]: Finished difference Result 33423 states and 99779 transitions. [2019-12-18 18:57:21,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-18 18:57:21,312 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-18 18:57:21,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:21,358 INFO L225 Difference]: With dead ends: 33423 [2019-12-18 18:57:21,359 INFO L226 Difference]: Without dead ends: 29432 [2019-12-18 18:57:21,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=282, Invalid=1610, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 18:57:21,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29432 states. [2019-12-18 18:57:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29432 to 23952. [2019-12-18 18:57:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23952 states. [2019-12-18 18:57:21,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23952 states to 23952 states and 71044 transitions. [2019-12-18 18:57:21,765 INFO L78 Accepts]: Start accepts. Automaton has 23952 states and 71044 transitions. Word has length 66 [2019-12-18 18:57:21,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:21,765 INFO L462 AbstractCegarLoop]: Abstraction has 23952 states and 71044 transitions. [2019-12-18 18:57:21,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 18:57:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 23952 states and 71044 transitions. [2019-12-18 18:57:21,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:57:21,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:21,790 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-18 18:57:21,790 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-18 18:57:21,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:21,790 INFO L82 PathProgramCache]: Analyzing trace with hash 963274045, now seen corresponding path program 4 times [2019-12-18 18:57:21,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:21,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470433902] [2019-12-18 18:57:21,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:22,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470433902] [2019-12-18 18:57:22,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:22,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 18:57:22,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786687502] [2019-12-18 18:57:22,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 18:57:22,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:22,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 18:57:22,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-18 18:57:22,512 INFO L87 Difference]: Start difference. First operand 23952 states and 71044 transitions. Second operand 18 states. [2019-12-18 18:57:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:26,453 INFO L93 Difference]: Finished difference Result 35181 states and 102675 transitions. [2019-12-18 18:57:26,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 18:57:26,453 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-18 18:57:26,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:26,491 INFO L225 Difference]: With dead ends: 35181 [2019-12-18 18:57:26,492 INFO L226 Difference]: Without dead ends: 27563 [2019-12-18 18:57:26,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 18:57:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27563 states. [2019-12-18 18:57:26,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27563 to 23826. [2019-12-18 18:57:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23826 states. [2019-12-18 18:57:26,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23826 states to 23826 states and 70517 transitions. [2019-12-18 18:57:26,834 INFO L78 Accepts]: Start accepts. Automaton has 23826 states and 70517 transitions. Word has length 66 [2019-12-18 18:57:26,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:26,835 INFO L462 AbstractCegarLoop]: Abstraction has 23826 states and 70517 transitions. [2019-12-18 18:57:26,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 18:57:26,835 INFO L276 IsEmpty]: Start isEmpty. Operand 23826 states and 70517 transitions. [2019-12-18 18:57:26,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:57:26,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:26,856 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-18 18:57:26,856 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-18 18:57:26,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:26,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1004915127, now seen corresponding path program 5 times [2019-12-18 18:57:26,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:26,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563236814] [2019-12-18 18:57:26,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:27,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-18 18:57:27,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563236814] [2019-12-18 18:57:27,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:27,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:57:27,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705899946] [2019-12-18 18:57:27,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:57:27,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:27,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:57:27,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:57:27,349 INFO L87 Difference]: Start difference. First operand 23826 states and 70517 transitions. Second operand 16 states. [2019-12-18 18:57:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:34,292 INFO L93 Difference]: Finished difference Result 46040 states and 133470 transitions. [2019-12-18 18:57:34,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-12-18 18:57:34,295 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-18 18:57:34,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:34,340 INFO L225 Difference]: With dead ends: 46040 [2019-12-18 18:57:34,340 INFO L226 Difference]: Without dead ends: 34704 [2019-12-18 18:57:34,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=706, Invalid=4406, Unknown=0, NotChecked=0, Total=5112 [2019-12-18 18:57:34,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34704 states. [2019-12-18 18:57:34,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34704 to 24617. [2019-12-18 18:57:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24617 states. [2019-12-18 18:57:34,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24617 states to 24617 states and 72341 transitions. [2019-12-18 18:57:34,773 INFO L78 Accepts]: Start accepts. Automaton has 24617 states and 72341 transitions. Word has length 66 [2019-12-18 18:57:34,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:34,774 INFO L462 AbstractCegarLoop]: Abstraction has 24617 states and 72341 transitions. [2019-12-18 18:57:34,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:57:34,774 INFO L276 IsEmpty]: Start isEmpty. Operand 24617 states and 72341 transitions. [2019-12-18 18:57:34,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:57:34,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:34,800 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-18 18:57:34,800 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-18 18:57:34,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:34,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1172772757, now seen corresponding path program 6 times [2019-12-18 18:57:34,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:34,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300369741] [2019-12-18 18:57:34,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:35,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300369741] [2019-12-18 18:57:35,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:35,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 18:57:35,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873904361] [2019-12-18 18:57:35,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 18:57:35,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:35,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 18:57:35,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-12-18 18:57:35,500 INFO L87 Difference]: Start difference. First operand 24617 states and 72341 transitions. Second operand 19 states. [2019-12-18 18:57:39,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:39,434 INFO L93 Difference]: Finished difference Result 28713 states and 83694 transitions. [2019-12-18 18:57:39,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 18:57:39,435 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-12-18 18:57:39,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:39,471 INFO L225 Difference]: With dead ends: 28713 [2019-12-18 18:57:39,471 INFO L226 Difference]: Without dead ends: 28292 [2019-12-18 18:57:39,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=216, Invalid=1190, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 18:57:39,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28292 states. [2019-12-18 18:57:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28292 to 24588. [2019-12-18 18:57:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24588 states. [2019-12-18 18:57:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24588 states to 24588 states and 72258 transitions. [2019-12-18 18:57:39,841 INFO L78 Accepts]: Start accepts. Automaton has 24588 states and 72258 transitions. Word has length 66 [2019-12-18 18:57:39,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:39,841 INFO L462 AbstractCegarLoop]: Abstraction has 24588 states and 72258 transitions. [2019-12-18 18:57:39,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 18:57:39,841 INFO L276 IsEmpty]: Start isEmpty. Operand 24588 states and 72258 transitions. [2019-12-18 18:57:39,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:57:39,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:39,865 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-18 18:57:39,866 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-18 18:57:39,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:39,866 INFO L82 PathProgramCache]: Analyzing trace with hash -990512747, now seen corresponding path program 7 times [2019-12-18 18:57:39,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:39,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445191475] [2019-12-18 18:57:39,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:40,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445191475] [2019-12-18 18:57:40,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:40,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:57:40,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149612949] [2019-12-18 18:57:40,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 18:57:40,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:40,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 18:57:40,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:57:40,166 INFO L87 Difference]: Start difference. First operand 24588 states and 72258 transitions. Second operand 13 states. [2019-12-18 18:57:42,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:42,975 INFO L93 Difference]: Finished difference Result 36135 states and 105692 transitions. [2019-12-18 18:57:42,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 18:57:42,976 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-18 18:57:42,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:43,013 INFO L225 Difference]: With dead ends: 36135 [2019-12-18 18:57:43,014 INFO L226 Difference]: Without dead ends: 27534 [2019-12-18 18:57:43,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 18:57:43,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27534 states. [2019-12-18 18:57:43,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27534 to 21674. [2019-12-18 18:57:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21674 states. [2019-12-18 18:57:43,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21674 states to 21674 states and 64153 transitions. [2019-12-18 18:57:43,566 INFO L78 Accepts]: Start accepts. Automaton has 21674 states and 64153 transitions. Word has length 66 [2019-12-18 18:57:43,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:43,567 INFO L462 AbstractCegarLoop]: Abstraction has 21674 states and 64153 transitions. [2019-12-18 18:57:43,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 18:57:43,567 INFO L276 IsEmpty]: Start isEmpty. Operand 21674 states and 64153 transitions. [2019-12-18 18:57:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:57:43,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:43,587 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-18 18:57:43,587 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-18 18:57:43,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:43,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1571120921, now seen corresponding path program 8 times [2019-12-18 18:57:43,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:43,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969355695] [2019-12-18 18:57:43,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:43,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969355695] [2019-12-18 18:57:43,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:43,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:57:43,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246999763] [2019-12-18 18:57:43,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:57:43,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:43,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:57:43,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:57:43,723 INFO L87 Difference]: Start difference. First operand 21674 states and 64153 transitions. Second operand 9 states. [2019-12-18 18:57:45,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:45,075 INFO L93 Difference]: Finished difference Result 39273 states and 115866 transitions. [2019-12-18 18:57:45,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 18:57:45,076 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 18:57:45,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:45,118 INFO L225 Difference]: With dead ends: 39273 [2019-12-18 18:57:45,118 INFO L226 Difference]: Without dead ends: 33065 [2019-12-18 18:57:45,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:57:45,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33065 states. [2019-12-18 18:57:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33065 to 21289. [2019-12-18 18:57:45,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21289 states. [2019-12-18 18:57:45,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21289 states to 21289 states and 63015 transitions. [2019-12-18 18:57:45,513 INFO L78 Accepts]: Start accepts. Automaton has 21289 states and 63015 transitions. Word has length 66 [2019-12-18 18:57:45,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:45,514 INFO L462 AbstractCegarLoop]: Abstraction has 21289 states and 63015 transitions. [2019-12-18 18:57:45,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:57:45,514 INFO L276 IsEmpty]: Start isEmpty. Operand 21289 states and 63015 transitions. [2019-12-18 18:57:45,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:57:45,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:45,536 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-18 18:57:45,537 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-18 18:57:45,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:45,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1064056595, now seen corresponding path program 9 times [2019-12-18 18:57:45,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:45,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072544612] [2019-12-18 18:57:45,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:45,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072544612] [2019-12-18 18:57:45,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:45,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:57:45,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647743371] [2019-12-18 18:57:45,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:57:45,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:45,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:57:45,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:57:45,668 INFO L87 Difference]: Start difference. First operand 21289 states and 63015 transitions. Second operand 9 states. [2019-12-18 18:57:48,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:48,411 INFO L93 Difference]: Finished difference Result 40307 states and 116882 transitions. [2019-12-18 18:57:48,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 18:57:48,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 18:57:48,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:48,462 INFO L225 Difference]: With dead ends: 40307 [2019-12-18 18:57:48,462 INFO L226 Difference]: Without dead ends: 40307 [2019-12-18 18:57:48,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2019-12-18 18:57:48,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40307 states. [2019-12-18 18:57:49,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40307 to 21639. [2019-12-18 18:57:49,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21639 states. [2019-12-18 18:57:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21639 states to 21639 states and 63684 transitions. [2019-12-18 18:57:49,090 INFO L78 Accepts]: Start accepts. Automaton has 21639 states and 63684 transitions. Word has length 66 [2019-12-18 18:57:49,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:49,090 INFO L462 AbstractCegarLoop]: Abstraction has 21639 states and 63684 transitions. [2019-12-18 18:57:49,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:57:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand 21639 states and 63684 transitions. [2019-12-18 18:57:49,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:57:49,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:49,112 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-18 18:57:49,113 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-18 18:57:49,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:49,113 INFO L82 PathProgramCache]: Analyzing trace with hash -766459999, now seen corresponding path program 10 times [2019-12-18 18:57:49,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:49,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145135827] [2019-12-18 18:57:49,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:49,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145135827] [2019-12-18 18:57:49,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:49,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:57:49,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275827777] [2019-12-18 18:57:49,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 18:57:49,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:49,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 18:57:49,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:57:49,457 INFO L87 Difference]: Start difference. First operand 21639 states and 63684 transitions. Second operand 13 states. [2019-12-18 18:57:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:52,034 INFO L93 Difference]: Finished difference Result 27418 states and 80052 transitions. [2019-12-18 18:57:52,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 18:57:52,035 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-18 18:57:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:52,069 INFO L225 Difference]: With dead ends: 27418 [2019-12-18 18:57:52,069 INFO L226 Difference]: Without dead ends: 26327 [2019-12-18 18:57:52,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-12-18 18:57:52,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26327 states. [2019-12-18 18:57:52,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26327 to 22359. [2019-12-18 18:57:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22359 states. [2019-12-18 18:57:52,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22359 states to 22359 states and 65539 transitions. [2019-12-18 18:57:52,403 INFO L78 Accepts]: Start accepts. Automaton has 22359 states and 65539 transitions. Word has length 66 [2019-12-18 18:57:52,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:52,404 INFO L462 AbstractCegarLoop]: Abstraction has 22359 states and 65539 transitions. [2019-12-18 18:57:52,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 18:57:52,404 INFO L276 IsEmpty]: Start isEmpty. Operand 22359 states and 65539 transitions. [2019-12-18 18:57:52,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:57:52,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:52,427 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-18 18:57:52,427 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-18 18:57:52,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:52,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1455956193, now seen corresponding path program 11 times [2019-12-18 18:57:52,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:52,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643406050] [2019-12-18 18:57:52,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:52,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:52,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643406050] [2019-12-18 18:57:52,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:52,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:57:52,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351491673] [2019-12-18 18:57:52,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 18:57:52,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:52,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 18:57:52,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:57:52,687 INFO L87 Difference]: Start difference. First operand 22359 states and 65539 transitions. Second operand 13 states. [2019-12-18 18:57:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:54,969 INFO L93 Difference]: Finished difference Result 28836 states and 83775 transitions. [2019-12-18 18:57:54,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 18:57:54,970 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-18 18:57:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:55,005 INFO L225 Difference]: With dead ends: 28836 [2019-12-18 18:57:55,005 INFO L226 Difference]: Without dead ends: 27179 [2019-12-18 18:57:55,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2019-12-18 18:57:55,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27179 states. [2019-12-18 18:57:55,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27179 to 21697. [2019-12-18 18:57:55,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21697 states. [2019-12-18 18:57:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21697 states to 21697 states and 63816 transitions. [2019-12-18 18:57:55,345 INFO L78 Accepts]: Start accepts. Automaton has 21697 states and 63816 transitions. Word has length 66 [2019-12-18 18:57:55,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:55,345 INFO L462 AbstractCegarLoop]: Abstraction has 21697 states and 63816 transitions. [2019-12-18 18:57:55,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 18:57:55,345 INFO L276 IsEmpty]: Start isEmpty. Operand 21697 states and 63816 transitions. [2019-12-18 18:57:55,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:57:55,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:55,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:57:55,368 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-18 18:57:55,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:55,368 INFO L82 PathProgramCache]: Analyzing trace with hash 640702257, now seen corresponding path program 12 times [2019-12-18 18:57:55,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:55,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741830448] [2019-12-18 18:57:55,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:55,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741830448] [2019-12-18 18:57:55,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:55,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:57:55,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038885600] [2019-12-18 18:57:55,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:57:55,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:55,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:57:55,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:57:55,462 INFO L87 Difference]: Start difference. First operand 21697 states and 63816 transitions. Second operand 4 states. [2019-12-18 18:57:55,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:57:55,612 INFO L93 Difference]: Finished difference Result 24868 states and 73497 transitions. [2019-12-18 18:57:55,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:57:55,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 18:57:55,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:57:55,643 INFO L225 Difference]: With dead ends: 24868 [2019-12-18 18:57:55,643 INFO L226 Difference]: Without dead ends: 24868 [2019-12-18 18:57:55,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:57:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24868 states. [2019-12-18 18:57:55,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24868 to 19654. [2019-12-18 18:57:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19654 states. [2019-12-18 18:57:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19654 states to 19654 states and 58432 transitions. [2019-12-18 18:57:55,952 INFO L78 Accepts]: Start accepts. Automaton has 19654 states and 58432 transitions. Word has length 66 [2019-12-18 18:57:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:57:55,953 INFO L462 AbstractCegarLoop]: Abstraction has 19654 states and 58432 transitions. [2019-12-18 18:57:55,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:57:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 19654 states and 58432 transitions. [2019-12-18 18:57:55,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:57:55,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:57:55,972 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-18 18:57:55,973 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-18 18:57:55,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:57:55,973 INFO L82 PathProgramCache]: Analyzing trace with hash -825405888, now seen corresponding path program 1 times [2019-12-18 18:57:55,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:57:55,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324715807] [2019-12-18 18:57:55,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:57:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:57:56,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:57:56,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324715807] [2019-12-18 18:57:56,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:57:56,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:57:56,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855296892] [2019-12-18 18:57:56,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:57:56,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:57:56,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:57:56,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:57:56,377 INFO L87 Difference]: Start difference. First operand 19654 states and 58432 transitions. Second operand 15 states. [2019-12-18 18:58:00,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:58:00,346 INFO L93 Difference]: Finished difference Result 28579 states and 83661 transitions. [2019-12-18 18:58:00,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 18:58:00,347 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 18:58:00,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:58:00,382 INFO L225 Difference]: With dead ends: 28579 [2019-12-18 18:58:00,382 INFO L226 Difference]: Without dead ends: 27004 [2019-12-18 18:58:00,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=366, Invalid=1890, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 18:58:00,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27004 states. [2019-12-18 18:58:00,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27004 to 20855. [2019-12-18 18:58:00,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20855 states. [2019-12-18 18:58:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20855 states to 20855 states and 61684 transitions. [2019-12-18 18:58:00,709 INFO L78 Accepts]: Start accepts. Automaton has 20855 states and 61684 transitions. Word has length 67 [2019-12-18 18:58:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:58:00,709 INFO L462 AbstractCegarLoop]: Abstraction has 20855 states and 61684 transitions. [2019-12-18 18:58:00,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:58:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 20855 states and 61684 transitions. [2019-12-18 18:58:00,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:58:00,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:58:00,730 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-18 18:58:00,730 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-18 18:58:00,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:58:00,730 INFO L82 PathProgramCache]: Analyzing trace with hash 519688642, now seen corresponding path program 2 times [2019-12-18 18:58:00,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:58:00,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438867620] [2019-12-18 18:58:00,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:58:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:58:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:58:01,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438867620] [2019-12-18 18:58:01,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:58:01,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:58:01,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864392854] [2019-12-18 18:58:01,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 18:58:01,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:58:01,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 18:58:01,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:58:01,084 INFO L87 Difference]: Start difference. First operand 20855 states and 61684 transitions. Second operand 13 states. [2019-12-18 18:58:04,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:58:04,445 INFO L93 Difference]: Finished difference Result 30165 states and 87640 transitions. [2019-12-18 18:58:04,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-18 18:58:04,445 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-18 18:58:04,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:58:04,477 INFO L225 Difference]: With dead ends: 30165 [2019-12-18 18:58:04,478 INFO L226 Difference]: Without dead ends: 24299 [2019-12-18 18:58:04,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=305, Invalid=1587, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 18:58:04,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24299 states. [2019-12-18 18:58:04,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24299 to 19273. [2019-12-18 18:58:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19273 states. [2019-12-18 18:58:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19273 states to 19273 states and 57241 transitions. [2019-12-18 18:58:04,778 INFO L78 Accepts]: Start accepts. Automaton has 19273 states and 57241 transitions. Word has length 67 [2019-12-18 18:58:04,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:58:04,778 INFO L462 AbstractCegarLoop]: Abstraction has 19273 states and 57241 transitions. [2019-12-18 18:58:04,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 18:58:04,778 INFO L276 IsEmpty]: Start isEmpty. Operand 19273 states and 57241 transitions. [2019-12-18 18:58:04,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:58:04,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:58:04,795 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-18 18:58:04,796 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:58:04,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:58:04,796 INFO L82 PathProgramCache]: Analyzing trace with hash 974434770, now seen corresponding path program 3 times [2019-12-18 18:58:04,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:58:04,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281153684] [2019-12-18 18:58:04,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:58:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:58:05,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:58:05,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281153684] [2019-12-18 18:58:05,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:58:05,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-18 18:58:05,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472721663] [2019-12-18 18:58:05,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 18:58:05,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:58:05,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 18:58:05,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-12-18 18:58:05,816 INFO L87 Difference]: Start difference. First operand 19273 states and 57241 transitions. Second operand 22 states. [2019-12-18 18:58:09,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:58:09,586 INFO L93 Difference]: Finished difference Result 21798 states and 63935 transitions. [2019-12-18 18:58:09,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 18:58:09,587 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2019-12-18 18:58:09,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:58:09,616 INFO L225 Difference]: With dead ends: 21798 [2019-12-18 18:58:09,616 INFO L226 Difference]: Without dead ends: 21060 [2019-12-18 18:58:09,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=264, Invalid=1716, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 18:58:09,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21060 states. [2019-12-18 18:58:09,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21060 to 19369. [2019-12-18 18:58:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19369 states. [2019-12-18 18:58:09,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19369 states to 19369 states and 57466 transitions. [2019-12-18 18:58:09,914 INFO L78 Accepts]: Start accepts. Automaton has 19369 states and 57466 transitions. Word has length 67 [2019-12-18 18:58:09,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:58:09,915 INFO L462 AbstractCegarLoop]: Abstraction has 19369 states and 57466 transitions. [2019-12-18 18:58:09,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 18:58:09,915 INFO L276 IsEmpty]: Start isEmpty. Operand 19369 states and 57466 transitions. [2019-12-18 18:58:09,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:58:09,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:58:09,936 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-18 18:58:09,936 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:58:09,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:58:09,936 INFO L82 PathProgramCache]: Analyzing trace with hash -17549224, now seen corresponding path program 4 times [2019-12-18 18:58:09,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:58:09,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652442476] [2019-12-18 18:58:09,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:58:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:58:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:58:10,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652442476] [2019-12-18 18:58:10,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:58:10,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:58:10,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676777082] [2019-12-18 18:58:10,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:58:10,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:58:10,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:58:10,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:58:10,155 INFO L87 Difference]: Start difference. First operand 19369 states and 57466 transitions. Second operand 11 states. [2019-12-18 18:58:11,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:58:11,746 INFO L93 Difference]: Finished difference Result 23818 states and 69724 transitions. [2019-12-18 18:58:11,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 18:58:11,746 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 18:58:11,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:58:11,775 INFO L225 Difference]: With dead ends: 23818 [2019-12-18 18:58:11,775 INFO L226 Difference]: Without dead ends: 22717 [2019-12-18 18:58:11,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-18 18:58:11,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22717 states. [2019-12-18 18:58:12,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22717 to 19093. [2019-12-18 18:58:12,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19093 states. [2019-12-18 18:58:12,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19093 states to 19093 states and 56783 transitions. [2019-12-18 18:58:12,068 INFO L78 Accepts]: Start accepts. Automaton has 19093 states and 56783 transitions. Word has length 67 [2019-12-18 18:58:12,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:58:12,068 INFO L462 AbstractCegarLoop]: Abstraction has 19093 states and 56783 transitions. [2019-12-18 18:58:12,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:58:12,068 INFO L276 IsEmpty]: Start isEmpty. Operand 19093 states and 56783 transitions. [2019-12-18 18:58:12,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:58:12,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:58:12,087 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-18 18:58:12,087 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:58:12,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:58:12,087 INFO L82 PathProgramCache]: Analyzing trace with hash -452614245, now seen corresponding path program 1 times [2019-12-18 18:58:12,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:58:12,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006860625] [2019-12-18 18:58:12,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:58:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:58:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:58:12,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006860625] [2019-12-18 18:58:12,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:58:12,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:58:12,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561365649] [2019-12-18 18:58:12,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 18:58:12,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:58:12,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 18:58:12,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:58:12,548 INFO L87 Difference]: Start difference. First operand 19093 states and 56783 transitions. Second operand 12 states. [2019-12-18 18:58:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:58:15,061 INFO L93 Difference]: Finished difference Result 38738 states and 112936 transitions. [2019-12-18 18:58:15,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 18:58:15,061 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 18:58:15,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:58:15,108 INFO L225 Difference]: With dead ends: 38738 [2019-12-18 18:58:15,108 INFO L226 Difference]: Without dead ends: 36054 [2019-12-18 18:58:15,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2019-12-18 18:58:15,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36054 states. [2019-12-18 18:58:15,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36054 to 19439. [2019-12-18 18:58:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19439 states. [2019-12-18 18:58:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19439 states to 19439 states and 57818 transitions. [2019-12-18 18:58:15,488 INFO L78 Accepts]: Start accepts. Automaton has 19439 states and 57818 transitions. Word has length 67 [2019-12-18 18:58:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:58:15,488 INFO L462 AbstractCegarLoop]: Abstraction has 19439 states and 57818 transitions. [2019-12-18 18:58:15,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 18:58:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 19439 states and 57818 transitions. [2019-12-18 18:58:15,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:58:15,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:58:15,506 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-18 18:58:15,507 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:58:15,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:58:15,507 INFO L82 PathProgramCache]: Analyzing trace with hash -2030490099, now seen corresponding path program 2 times [2019-12-18 18:58:15,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:58:15,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527584564] [2019-12-18 18:58:15,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:58:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:58:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:58:15,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527584564] [2019-12-18 18:58:15,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:58:15,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:58:15,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609633685] [2019-12-18 18:58:15,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:58:15,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:58:15,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:58:15,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:58:15,628 INFO L87 Difference]: Start difference. First operand 19439 states and 57818 transitions. Second operand 10 states. [2019-12-18 18:58:16,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:58:16,676 INFO L93 Difference]: Finished difference Result 40609 states and 119501 transitions. [2019-12-18 18:58:16,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 18:58:16,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 18:58:16,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:58:16,727 INFO L225 Difference]: With dead ends: 40609 [2019-12-18 18:58:16,727 INFO L226 Difference]: Without dead ends: 35441 [2019-12-18 18:58:16,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-12-18 18:58:16,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35441 states. [2019-12-18 18:58:17,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35441 to 19685. [2019-12-18 18:58:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19685 states. [2019-12-18 18:58:17,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19685 states to 19685 states and 58390 transitions. [2019-12-18 18:58:17,135 INFO L78 Accepts]: Start accepts. Automaton has 19685 states and 58390 transitions. Word has length 67 [2019-12-18 18:58:17,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:58:17,135 INFO L462 AbstractCegarLoop]: Abstraction has 19685 states and 58390 transitions. [2019-12-18 18:58:17,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:58:17,135 INFO L276 IsEmpty]: Start isEmpty. Operand 19685 states and 58390 transitions. [2019-12-18 18:58:17,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:58:17,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:58:17,156 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-18 18:58:17,156 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:58:17,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:58:17,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1743153411, now seen corresponding path program 3 times [2019-12-18 18:58:17,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:58:17,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541372051] [2019-12-18 18:58:17,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:58:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:58:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:58:17,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541372051] [2019-12-18 18:58:17,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:58:17,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:58:17,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535799292] [2019-12-18 18:58:17,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:58:17,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:58:17,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:58:17,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:58:17,295 INFO L87 Difference]: Start difference. First operand 19685 states and 58390 transitions. Second operand 6 states. [2019-12-18 18:58:17,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:58:17,925 INFO L93 Difference]: Finished difference Result 32167 states and 94666 transitions. [2019-12-18 18:58:17,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:58:17,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-18 18:58:17,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:58:17,964 INFO L225 Difference]: With dead ends: 32167 [2019-12-18 18:58:17,964 INFO L226 Difference]: Without dead ends: 31586 [2019-12-18 18:58:17,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:58:18,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31586 states. [2019-12-18 18:58:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31586 to 15739. [2019-12-18 18:58:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15739 states. [2019-12-18 18:58:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15739 states to 15739 states and 45809 transitions. [2019-12-18 18:58:18,272 INFO L78 Accepts]: Start accepts. Automaton has 15739 states and 45809 transitions. Word has length 67 [2019-12-18 18:58:18,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:58:18,273 INFO L462 AbstractCegarLoop]: Abstraction has 15739 states and 45809 transitions. [2019-12-18 18:58:18,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:58:18,273 INFO L276 IsEmpty]: Start isEmpty. Operand 15739 states and 45809 transitions. [2019-12-18 18:58:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:58:18,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:58:18,287 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-18 18:58:18,288 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:58:18,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:58:18,288 INFO L82 PathProgramCache]: Analyzing trace with hash 953948895, now seen corresponding path program 1 times [2019-12-18 18:58:18,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:58:18,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894396122] [2019-12-18 18:58:18,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:58:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:58:18,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:58:18,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894396122] [2019-12-18 18:58:18,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:58:18,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:58:18,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399622319] [2019-12-18 18:58:18,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:58:18,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:58:18,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:58:18,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:58:18,819 INFO L87 Difference]: Start difference. First operand 15739 states and 45809 transitions. Second operand 16 states. [2019-12-18 18:58:22,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:58:22,263 INFO L93 Difference]: Finished difference Result 32706 states and 96532 transitions. [2019-12-18 18:58:22,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 18:58:22,264 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 18:58:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:58:22,303 INFO L225 Difference]: With dead ends: 32706 [2019-12-18 18:58:22,303 INFO L226 Difference]: Without dead ends: 28793 [2019-12-18 18:58:22,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=384, Invalid=2268, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 18:58:22,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28793 states. [2019-12-18 18:58:22,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28793 to 16424. [2019-12-18 18:58:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16424 states. [2019-12-18 18:58:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16424 states to 16424 states and 47684 transitions. [2019-12-18 18:58:22,631 INFO L78 Accepts]: Start accepts. Automaton has 16424 states and 47684 transitions. Word has length 67 [2019-12-18 18:58:22,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:58:22,632 INFO L462 AbstractCegarLoop]: Abstraction has 16424 states and 47684 transitions. [2019-12-18 18:58:22,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:58:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 16424 states and 47684 transitions. [2019-12-18 18:58:22,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:58:22,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:58:22,653 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-18 18:58:22,653 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:58:22,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:58:22,653 INFO L82 PathProgramCache]: Analyzing trace with hash 2132262799, now seen corresponding path program 2 times [2019-12-18 18:58:22,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:58:22,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751537524] [2019-12-18 18:58:22,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:58:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:58:22,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:58:22,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751537524] [2019-12-18 18:58:23,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:58:23,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:58:23,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690544855] [2019-12-18 18:58:23,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:58:23,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:58:23,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:58:23,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:58:23,001 INFO L87 Difference]: Start difference. First operand 16424 states and 47684 transitions. Second operand 15 states. [2019-12-18 18:58:24,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:58:24,803 INFO L93 Difference]: Finished difference Result 29218 states and 85816 transitions. [2019-12-18 18:58:24,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 18:58:24,803 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 18:58:24,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:58:24,842 INFO L225 Difference]: With dead ends: 29218 [2019-12-18 18:58:24,842 INFO L226 Difference]: Without dead ends: 28977 [2019-12-18 18:58:24,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2019-12-18 18:58:24,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28977 states. [2019-12-18 18:58:25,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28977 to 16489. [2019-12-18 18:58:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16489 states. [2019-12-18 18:58:25,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16489 states to 16489 states and 47796 transitions. [2019-12-18 18:58:25,155 INFO L78 Accepts]: Start accepts. Automaton has 16489 states and 47796 transitions. Word has length 67 [2019-12-18 18:58:25,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:58:25,155 INFO L462 AbstractCegarLoop]: Abstraction has 16489 states and 47796 transitions. [2019-12-18 18:58:25,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:58:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 16489 states and 47796 transitions. [2019-12-18 18:58:25,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:58:25,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:58:25,171 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-18 18:58:25,172 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:58:25,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:58:25,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1855680179, now seen corresponding path program 3 times [2019-12-18 18:58:25,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:58:25,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834711389] [2019-12-18 18:58:25,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:58:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:58:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:58:25,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834711389] [2019-12-18 18:58:25,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:58:25,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:58:25,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218628060] [2019-12-18 18:58:25,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:58:25,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:58:25,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:58:25,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:58:25,406 INFO L87 Difference]: Start difference. First operand 16489 states and 47796 transitions. Second operand 11 states. [2019-12-18 18:58:26,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:58:26,741 INFO L93 Difference]: Finished difference Result 33466 states and 97489 transitions. [2019-12-18 18:58:26,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 18:58:26,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 18:58:26,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:58:26,785 INFO L225 Difference]: With dead ends: 33466 [2019-12-18 18:58:26,785 INFO L226 Difference]: Without dead ends: 29264 [2019-12-18 18:58:26,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=208, Invalid=848, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 18:58:26,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29264 states. [2019-12-18 18:58:27,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29264 to 14925. [2019-12-18 18:58:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14925 states. [2019-12-18 18:58:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14925 states to 14925 states and 43675 transitions. [2019-12-18 18:58:27,083 INFO L78 Accepts]: Start accepts. Automaton has 14925 states and 43675 transitions. Word has length 67 [2019-12-18 18:58:27,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:58:27,084 INFO L462 AbstractCegarLoop]: Abstraction has 14925 states and 43675 transitions. [2019-12-18 18:58:27,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:58:27,084 INFO L276 IsEmpty]: Start isEmpty. Operand 14925 states and 43675 transitions. [2019-12-18 18:58:27,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:58:27,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:58:27,098 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-18 18:58:27,098 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:58:27,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:58:27,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1711385183, now seen corresponding path program 4 times [2019-12-18 18:58:27,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:58:27,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985448214] [2019-12-18 18:58:27,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:58:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:58:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:58:27,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985448214] [2019-12-18 18:58:27,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:58:27,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:58:27,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295931524] [2019-12-18 18:58:27,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:58:27,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:58:27,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:58:27,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:58:27,216 INFO L87 Difference]: Start difference. First operand 14925 states and 43675 transitions. Second operand 6 states. [2019-12-18 18:58:27,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:58:27,360 INFO L93 Difference]: Finished difference Result 14725 states and 42845 transitions. [2019-12-18 18:58:27,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:58:27,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-18 18:58:27,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:58:27,391 INFO L225 Difference]: With dead ends: 14725 [2019-12-18 18:58:27,391 INFO L226 Difference]: Without dead ends: 14725 [2019-12-18 18:58:27,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:58:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14725 states. [2019-12-18 18:58:27,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14725 to 13334. [2019-12-18 18:58:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13334 states. [2019-12-18 18:58:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13334 states to 13334 states and 38693 transitions. [2019-12-18 18:58:27,724 INFO L78 Accepts]: Start accepts. Automaton has 13334 states and 38693 transitions. Word has length 67 [2019-12-18 18:58:27,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:58:27,724 INFO L462 AbstractCegarLoop]: Abstraction has 13334 states and 38693 transitions. [2019-12-18 18:58:27,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:58:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 13334 states and 38693 transitions. [2019-12-18 18:58:27,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:58:27,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:58:27,743 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-18 18:58:27,743 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:58:27,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:58:27,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1080421452, now seen corresponding path program 5 times [2019-12-18 18:58:27,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:58:27,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081391881] [2019-12-18 18:58:27,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:58:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:58:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:58:27,909 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:58:27,909 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:58:27,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L815: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2396~0.base_39| 4)) (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1_used~0_439 0) (= v_~y$w_buff1~0_188 0) (= 0 v_~y$r_buff1_thd3~0_309) (= v_~y$read_delayed~0_7 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t2396~0.base_39| 1)) (= v_~y$r_buff1_thd0~0_201 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2396~0.base_39|)) (= v_~main$tmp_guard0~0_41 0) (= 0 v_~y$w_buff0~0_254) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2396~0.base_39| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2396~0.base_39|) |v_ULTIMATE.start_main_~#t2396~0.offset_26| 0)) |v_#memory_int_23|) (= 0 v_~y$r_buff0_thd3~0_343) (< 0 |v_#StackHeapBarrier_15|) (= v_~main$tmp_guard1~0_39 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 v_~y$flush_delayed~0_35) (= 0 v_~y$r_buff0_thd2~0_104) (= v_~weak$$choice2~0_129 0) (= 0 |v_#NULL.base_4|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_134 0) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= v_~y$w_buff0_used~0_785 0) (= |v_#NULL.offset_4| 0) (= 0 v_~x~0_158) (= 0 v_~y$r_buff1_thd2~0_197) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2396~0.base_39|) (= |v_ULTIMATE.start_main_~#t2396~0.offset_26| 0) (= v_~y~0_189 0) (= v_~y$r_buff0_thd1~0_218 0) (= v_~__unbuffered_cnt~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_785, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_133|, ULTIMATE.start_main_~#t2398~0.base=|v_ULTIMATE.start_main_~#t2398~0.base_27|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_293|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_104|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_47|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_~#t2396~0.base=|v_ULTIMATE.start_main_~#t2396~0.base_39|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_78|, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_343, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_218, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, ULTIMATE.start_main_~#t2398~0.offset=|v_ULTIMATE.start_main_~#t2398~0.offset_20|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~y~0=v_~y~0_189, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_18|, ULTIMATE.start_main_~#t2397~0.base=|v_ULTIMATE.start_main_~#t2397~0.base_37|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ULTIMATE.start_main_~#t2397~0.offset=|v_ULTIMATE.start_main_~#t2397~0.offset_25|, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_197, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_188, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, #valid=|v_#valid_72|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, #memory_int=|v_#memory_int_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_129, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_201, ~x~0=v_~x~0_158, ULTIMATE.start_main_~#t2396~0.offset=|v_ULTIMATE.start_main_~#t2396~0.offset_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2398~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t2396~0.base, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~y$r_buff1_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2398~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t2397~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_#t~nondet45, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2397~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t2396~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 18:58:27,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_76 v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_37 v_~y$w_buff1~0_27) (= v_~y$w_buff0_used~0_124 1) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_15 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= 1 v_~y$w_buff0~0_36) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|) (= 0 (mod v_~y$w_buff1_used~0_76 256))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_37, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_36, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_15, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 18:58:27,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L815-1-->L817: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2397~0.base_11| 0)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2397~0.base_11|)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2397~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2397~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2397~0.base_11|) |v_ULTIMATE.start_main_~#t2397~0.offset_10| 1)) |v_#memory_int_15|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2397~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t2397~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2397~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2397~0.base=|v_ULTIMATE.start_main_~#t2397~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2397~0.offset=|v_ULTIMATE.start_main_~#t2397~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2397~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2397~0.offset] because there is no mapped edge [2019-12-18 18:58:27,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L817-1-->L819: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2398~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2398~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2398~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t2398~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2398~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2398~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2398~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2398~0.base_11|) |v_ULTIMATE.start_main_~#t2398~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2398~0.base=|v_ULTIMATE.start_main_~#t2398~0.base_11|, ULTIMATE.start_main_~#t2398~0.offset=|v_ULTIMATE.start_main_~#t2398~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2398~0.base, ULTIMATE.start_main_~#t2398~0.offset, #length] because there is no mapped edge [2019-12-18 18:58:27,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L782-->L782-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In546318595 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite24_Out546318595| |P2Thread1of1ForFork2_#t~ite23_Out546318595|) (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In546318595 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In546318595 256)) (and (= 0 (mod ~y$r_buff1_thd3~0_In546318595 256)) .cse0) (and .cse0 (= (mod ~y$w_buff1_used~0_In546318595 256) 0)))) (= |P2Thread1of1ForFork2_#t~ite23_Out546318595| ~y$w_buff1~0_In546318595) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite24_Out546318595| ~y$w_buff1~0_In546318595) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite23_In546318595| |P2Thread1of1ForFork2_#t~ite23_Out546318595|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In546318595|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In546318595, ~y$w_buff1~0=~y$w_buff1~0_In546318595, ~y$w_buff0_used~0=~y$w_buff0_used~0_In546318595, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In546318595, ~weak$$choice2~0=~weak$$choice2~0_In546318595, ~y$w_buff1_used~0=~y$w_buff1_used~0_In546318595} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out546318595|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out546318595|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In546318595, ~y$w_buff1~0=~y$w_buff1~0_In546318595, ~y$w_buff0_used~0=~y$w_buff0_used~0_In546318595, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In546318595, ~weak$$choice2~0=~weak$$choice2~0_In546318595, ~y$w_buff1_used~0=~y$w_buff1_used~0_In546318595} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 18:58:27,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1017931796 256) 0))) (or (and (= ~y$w_buff0_used~0_In1017931796 |P2Thread1of1ForFork2_#t~ite27_Out1017931796|) (= |P2Thread1of1ForFork2_#t~ite26_In1017931796| |P2Thread1of1ForFork2_#t~ite26_Out1017931796|) (not .cse0)) (and (= |P2Thread1of1ForFork2_#t~ite26_Out1017931796| |P2Thread1of1ForFork2_#t~ite27_Out1017931796|) (= |P2Thread1of1ForFork2_#t~ite26_Out1017931796| ~y$w_buff0_used~0_In1017931796) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1017931796 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1017931796 256))) (and (= 0 (mod ~y$w_buff1_used~0_In1017931796 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1017931796 256)))) .cse0))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1017931796, P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In1017931796|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1017931796, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1017931796, ~weak$$choice2~0=~weak$$choice2~0_In1017931796, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1017931796} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out1017931796|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1017931796, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1017931796, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1017931796, ~weak$$choice2~0=~weak$$choice2~0_In1017931796, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out1017931796|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1017931796} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-18 18:58:27,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1222817280 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite30_Out-1222817280| ~y$w_buff1_used~0_In-1222817280) (= |P2Thread1of1ForFork2_#t~ite29_In-1222817280| |P2Thread1of1ForFork2_#t~ite29_Out-1222817280|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite29_Out-1222817280| |P2Thread1of1ForFork2_#t~ite30_Out-1222817280|) (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1222817280 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd3~0_In-1222817280 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-1222817280 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1222817280 256) 0)))) (= |P2Thread1of1ForFork2_#t~ite29_Out-1222817280| ~y$w_buff1_used~0_In-1222817280)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1222817280, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1222817280, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1222817280, ~weak$$choice2~0=~weak$$choice2~0_In-1222817280, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-1222817280|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1222817280} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1222817280, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1222817280, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1222817280|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1222817280, ~weak$$choice2~0=~weak$$choice2~0_In-1222817280, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1222817280|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1222817280} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 18:58:27,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L785-->L786: Formula: (and (= v_~y$r_buff0_thd3~0_93 v_~y$r_buff0_thd3~0_92) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_92, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_10|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-18 18:58:27,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L788-->L792: Formula: (and (= v_~y~0_52 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_52} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 18:58:27,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L792-2-->L792-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1314129675 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1314129675 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite38_Out-1314129675| ~y~0_In-1314129675) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite38_Out-1314129675| ~y$w_buff1~0_In-1314129675)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1314129675, ~y$w_buff1~0=~y$w_buff1~0_In-1314129675, ~y~0=~y~0_In-1314129675, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1314129675} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1314129675, ~y$w_buff1~0=~y$w_buff1~0_In-1314129675, ~y~0=~y~0_In-1314129675, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1314129675|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1314129675} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 18:58:27,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1962401075 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1962401075 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1962401075| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1962401075| ~y$w_buff0_used~0_In-1962401075) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1962401075, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1962401075} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1962401075|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1962401075, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1962401075} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 18:58:27,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In607254649 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In607254649 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In607254649 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In607254649 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out607254649|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In607254649 |P0Thread1of1ForFork0_#t~ite6_Out607254649|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In607254649, ~y$w_buff0_used~0=~y$w_buff0_used~0_In607254649, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In607254649, ~y$w_buff1_used~0=~y$w_buff1_used~0_In607254649} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out607254649|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In607254649, ~y$w_buff0_used~0=~y$w_buff0_used~0_In607254649, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In607254649, ~y$w_buff1_used~0=~y$w_buff1_used~0_In607254649} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 18:58:27,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L759-2-->L759-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite10_Out1787368570| |P1Thread1of1ForFork1_#t~ite9_Out1787368570|)) (.cse0 (= (mod ~y$w_buff1_used~0_In1787368570 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1787368570 256) 0))) (or (and (not .cse0) (not .cse1) .cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out1787368570| ~y$w_buff1~0_In1787368570)) (and .cse2 (= ~y~0_In1787368570 |P1Thread1of1ForFork1_#t~ite9_Out1787368570|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1787368570, ~y$w_buff1~0=~y$w_buff1~0_In1787368570, ~y~0=~y~0_In1787368570, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1787368570} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1787368570, ~y$w_buff1~0=~y$w_buff1~0_In1787368570, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1787368570|, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out1787368570|, ~y~0=~y~0_In1787368570, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1787368570} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 18:58:27,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L792-4-->L793: Formula: (= v_~y~0_32 |v_P2Thread1of1ForFork2_#t~ite38_12|) InVars {P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_12|} OutVars{~y~0=v_~y~0_32, P2Thread1of1ForFork2_#t~ite39=|v_P2Thread1of1ForFork2_#t~ite39_7|, P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_11|} AuxVars[] AssignedVars[~y~0, P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 18:58:27,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-2138170486 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2138170486 256)))) (or (and (= ~y$w_buff0_used~0_In-2138170486 |P2Thread1of1ForFork2_#t~ite40_Out-2138170486|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-2138170486|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2138170486, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2138170486} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2138170486, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2138170486, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-2138170486|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 18:58:27,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L794-->L794-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1658193905 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1658193905 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1658193905 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In1658193905 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out1658193905| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite41_Out1658193905| ~y$w_buff1_used~0_In1658193905) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1658193905, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1658193905, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1658193905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1658193905} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1658193905, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1658193905, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1658193905|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1658193905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1658193905} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 18:58:27,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In135541071 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In135541071 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out135541071| ~y$r_buff0_thd3~0_In135541071) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out135541071| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In135541071, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In135541071} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In135541071, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out135541071|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In135541071} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 18:58:27,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L796-->L796-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In-1072874886 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1072874886 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1072874886 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1072874886 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite43_Out-1072874886| 0)) (and (= ~y$r_buff1_thd3~0_In-1072874886 |P2Thread1of1ForFork2_#t~ite43_Out-1072874886|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1072874886, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1072874886, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1072874886, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1072874886} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1072874886, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1072874886, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1072874886, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1072874886|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1072874886} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 18:58:27,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L745-->L746: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-710455967 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-710455967 256)))) (or (and (= ~y$r_buff0_thd1~0_Out-710455967 ~y$r_buff0_thd1~0_In-710455967) (or .cse0 .cse1)) (and (not .cse1) (= ~y$r_buff0_thd1~0_Out-710455967 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-710455967, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-710455967} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-710455967, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-710455967|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-710455967} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 18:58:27,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1920851308 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1920851308 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In1920851308 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1920851308 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In1920851308 |P0Thread1of1ForFork0_#t~ite8_Out1920851308|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1920851308|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1920851308, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1920851308, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1920851308, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1920851308} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1920851308, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1920851308, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1920851308|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1920851308, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1920851308} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 18:58:27,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L746-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_95 |v_P0Thread1of1ForFork0_#t~ite8_38|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_95, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_37|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 18:58:27,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L796-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_34| v_~y$r_buff1_thd3~0_152) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_152, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_33|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 18:58:27,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In787533039 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In787533039 256) 0))) (or (and (= ~y$w_buff0_used~0_In787533039 |P1Thread1of1ForFork1_#t~ite11_Out787533039|) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out787533039| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In787533039, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In787533039} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In787533039, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In787533039, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out787533039|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 18:58:27,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1682923523 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1682923523 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1682923523 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1682923523 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1682923523|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1682923523 |P1Thread1of1ForFork1_#t~ite12_Out-1682923523|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1682923523, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1682923523, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1682923523, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1682923523} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1682923523, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1682923523, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1682923523, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1682923523|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1682923523} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 18:58:27,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-726180853 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-726180853 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In-726180853 |P1Thread1of1ForFork1_#t~ite13_Out-726180853|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-726180853|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-726180853, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-726180853} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-726180853, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-726180853, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-726180853|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 18:58:27,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L763-->L763-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-2140932678 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-2140932678 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-2140932678 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2140932678 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-2140932678 |P1Thread1of1ForFork1_#t~ite14_Out-2140932678|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-2140932678|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2140932678, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2140932678, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2140932678, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2140932678} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2140932678, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2140932678, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2140932678, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2140932678|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2140932678} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 18:58:27,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_109 |v_P1Thread1of1ForFork1_#t~ite14_32|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_109, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 18:58:27,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L823-->L825-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_137 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_31 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 18:58:27,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L825-2-->L825-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1859884093 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1859884093 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1859884093| ~y$w_buff1~0_In-1859884093)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1859884093| ~y~0_In-1859884093)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1859884093, ~y~0=~y~0_In-1859884093, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1859884093, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1859884093} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1859884093, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1859884093|, ~y~0=~y~0_In-1859884093, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1859884093, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1859884093} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 18:58:27,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L825-4-->L826: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~y~0] because there is no mapped edge [2019-12-18 18:58:27,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1002495513 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1002495513 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1002495513 |ULTIMATE.start_main_#t~ite49_Out1002495513|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out1002495513|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1002495513, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1002495513} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1002495513, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1002495513, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1002495513|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 18:58:27,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L827-->L827-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1705408910 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1705408910 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1705408910 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1705408910 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out1705408910| ~y$w_buff1_used~0_In1705408910) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out1705408910| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1705408910, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1705408910, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1705408910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1705408910} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1705408910|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1705408910, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1705408910, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1705408910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1705408910} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 18:58:27,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In476149534 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In476149534 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out476149534| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out476149534| ~y$r_buff0_thd0~0_In476149534) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In476149534, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In476149534} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out476149534|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In476149534, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In476149534} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 18:58:27,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L829-->L829-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In677552315 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In677552315 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In677552315 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In677552315 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out677552315| ~y$r_buff1_thd0~0_In677552315) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out677552315| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In677552315, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In677552315, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In677552315, ~y$w_buff1_used~0=~y$w_buff1_used~0_In677552315} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out677552315|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In677552315, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In677552315, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In677552315, ~y$w_buff1_used~0=~y$w_buff1_used~0_In677552315} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 18:58:27,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L829-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= 2 v_~x~0_130) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 2 v_~__unbuffered_p2_EAX~0_23) (= v_~__unbuffered_p2_EBX~0_31 0) (= v_~y$r_buff1_thd0~0_163 |v_ULTIMATE.start_main_#t~ite52_41|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_163, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:58:28,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:58:28 BasicIcfg [2019-12-18 18:58:28,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:58:28,024 INFO L168 Benchmark]: Toolchain (without parser) took 147068.15 ms. Allocated memory was 144.7 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 101.1 MB in the beginning and 888.5 MB in the end (delta: -787.4 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-18 18:58:28,024 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 18:58:28,025 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.02 ms. Allocated memory was 144.7 MB in the beginning and 198.7 MB in the end (delta: 54.0 MB). Free memory was 100.9 MB in the beginning and 150.4 MB in the end (delta: -49.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-18 18:58:28,025 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.72 ms. Allocated memory is still 198.7 MB. Free memory was 150.4 MB in the beginning and 147.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:58:28,026 INFO L168 Benchmark]: Boogie Preprocessor took 54.07 ms. Allocated memory is still 198.7 MB. Free memory was 147.7 MB in the beginning and 144.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:58:28,026 INFO L168 Benchmark]: RCFGBuilder took 827.59 ms. Allocated memory is still 198.7 MB. Free memory was 144.9 MB in the beginning and 95.1 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-18 18:58:28,026 INFO L168 Benchmark]: TraceAbstraction took 145340.70 ms. Allocated memory was 198.7 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 95.1 MB in the beginning and 888.5 MB in the end (delta: -793.4 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 18:58:28,028 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.48 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 766.02 ms. Allocated memory was 144.7 MB in the beginning and 198.7 MB in the end (delta: 54.0 MB). Free memory was 100.9 MB in the beginning and 150.4 MB in the end (delta: -49.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.72 ms. Allocated memory is still 198.7 MB. Free memory was 150.4 MB in the beginning and 147.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.07 ms. Allocated memory is still 198.7 MB. Free memory was 147.7 MB in the beginning and 144.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 827.59 ms. Allocated memory is still 198.7 MB. Free memory was 144.9 MB in the beginning and 95.1 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 145340.70 ms. Allocated memory was 198.7 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 95.1 MB in the beginning and 888.5 MB in the end (delta: -793.4 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 252 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 241 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 78269 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L815] FCALL, FORK 0 pthread_create(&t2396, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L733] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L734] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L735] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L736] 1 y$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2397, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2398, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 3 __unbuffered_p2_EAX = x [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 y$flush_delayed = weak$$choice2 [L779] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y=0] [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L759] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 145.0s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 78.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9778 SDtfs, 12993 SDslu, 45757 SDs, 0 SdLazy, 46622 SolverSat, 739 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 852 GetRequests, 53 SyntacticMatches, 49 SemanticMatches, 750 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6027 ImplicationChecksByTransitivity, 16.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148639occurred 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: 33.8s AutomataMinimizationTime, 38 MinimizatonAttempts, 273315 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 2080 NumberOfCodeBlocks, 2080 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1975 ConstructedInterpolants, 0 QuantifiedInterpolants, 818508 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...