/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:57:05,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:57:05,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:57:05,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:57:05,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:57:05,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:57:05,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:57:05,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:57:05,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:57:05,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:57:05,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:57:05,644 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:57:05,644 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:57:05,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:57:05,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:57:05,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:57:05,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:57:05,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:57:05,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:57:05,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:57:05,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:57:05,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:57:05,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:57:05,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:57:05,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:57:05,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:57:05,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:57:05,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:57:05,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:57:05,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:57:05,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:57:05,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:57:05,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:57:05,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:57:05,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:57:05,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:57:05,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:57:05,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:57:05,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:57:05,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:57:05,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:57:05,686 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:57:05,710 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:57:05,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:57:05,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:57:05,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:57:05,711 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:57:05,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:57:05,717 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:57:05,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:57:05,717 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:57:05,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:57:05,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:57:05,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:57:05,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:57:05,718 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:57:05,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:57:05,718 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:57:05,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:57:05,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:57:05,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:57:05,719 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:57:05,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:57:05,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:57:05,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:57:05,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:57:05,720 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:57:05,720 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:57:05,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:57:05,721 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:57:05,721 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:57:05,721 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:57:05,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:57:06,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:57:06,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:57:06,016 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:57:06,016 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:57:06,017 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i [2019-12-18 12:57:06,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23f5be9d4/719ddc7e417541609c514b0d866835bd/FLAG3bdcf7b46 [2019-12-18 12:57:06,676 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:57:06,678 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i [2019-12-18 12:57:06,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23f5be9d4/719ddc7e417541609c514b0d866835bd/FLAG3bdcf7b46 [2019-12-18 12:57:06,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23f5be9d4/719ddc7e417541609c514b0d866835bd [2019-12-18 12:57:06,890 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:57:06,892 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:57:06,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:57:06,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:57:06,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:57:06,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:57:06" (1/1) ... [2019-12-18 12:57:06,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33785319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:57:06, skipping insertion in model container [2019-12-18 12:57:06,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:57:06" (1/1) ... [2019-12-18 12:57:06,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:57:06,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:57:07,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:57:07,623 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:57:07,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:57:07,777 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:57:07,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:57:07 WrapperNode [2019-12-18 12:57:07,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:57:07,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:57:07,778 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:57:07,778 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:57:07,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:57:07" (1/1) ... [2019-12-18 12:57:07,822 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:57:07" (1/1) ... [2019-12-18 12:57:07,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:57:07,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:57:07,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:57:07,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:57:07,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:57:07" (1/1) ... [2019-12-18 12:57:07,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:57:07" (1/1) ... [2019-12-18 12:57:07,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:57:07" (1/1) ... [2019-12-18 12:57:07,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:57:07" (1/1) ... [2019-12-18 12:57:07,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:57:07" (1/1) ... [2019-12-18 12:57:07,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:57:07" (1/1) ... [2019-12-18 12:57:07,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:57:07" (1/1) ... [2019-12-18 12:57:07,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:57:07,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:57:07,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:57:07,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:57:07,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:57:07" (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 12:57:07,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:57:07,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:57:07,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:57:07,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:57:07,977 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:57:07,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:57:07,978 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:57:07,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:57:07,978 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:57:07,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:57:07,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:57:07,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:57:07,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:57:07,981 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 12:57:08,736 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:57:08,736 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:57:08,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:57:08 BoogieIcfgContainer [2019-12-18 12:57:08,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:57:08,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:57:08,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:57:08,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:57:08,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:57:06" (1/3) ... [2019-12-18 12:57:08,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f259a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:57:08, skipping insertion in model container [2019-12-18 12:57:08,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:57:07" (2/3) ... [2019-12-18 12:57:08,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f259a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:57:08, skipping insertion in model container [2019-12-18 12:57:08,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:57:08" (3/3) ... [2019-12-18 12:57:08,751 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_tso.opt.i [2019-12-18 12:57:08,762 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:57:08,762 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:57:08,776 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:57:08,777 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:57:08,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,841 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,841 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,841 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,842 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,842 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,854 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,855 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,887 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,887 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,928 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,930 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,944 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,944 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,944 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,949 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:57:08,970 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:57:08,991 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:57:08,991 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:57:08,991 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:57:08,991 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:57:08,991 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:57:08,992 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:57:08,992 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:57:08,992 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:57:09,013 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 12:57:09,014 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 12:57:09,102 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 12:57:09,102 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:57:09,122 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:57:09,152 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 12:57:09,213 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 12:57:09,214 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:57:09,224 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:57:09,248 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:57:09,250 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:57:14,653 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 12:57:14,770 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 12:57:15,020 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-18 12:57:15,020 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-18 12:57:15,024 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-18 12:57:36,585 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-18 12:57:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-18 12:57:36,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:57:36,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:36,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:57:36,594 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 12:57:36,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:36,601 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-18 12:57:36,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:36,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271799254] [2019-12-18 12:57:36,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:36,847 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 12:57:36,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271799254] [2019-12-18 12:57:36,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:36,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:57:36,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287860304] [2019-12-18 12:57:36,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:57:36,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:36,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:57:36,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:36,873 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-18 12:57:38,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:38,527 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-18 12:57:38,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:57:38,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:57:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:42,397 INFO L225 Difference]: With dead ends: 121140 [2019-12-18 12:57:42,397 INFO L226 Difference]: Without dead ends: 107958 [2019-12-18 12:57:42,399 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 12:57:46,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-18 12:57:49,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-18 12:57:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-18 12:57:49,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-18 12:57:49,980 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-18 12:57:49,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:49,980 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-18 12:57:49,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:57:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-18 12:57:49,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:57:49,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:49,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:49,986 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 12:57:49,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:49,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-18 12:57:49,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:49,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398765246] [2019-12-18 12:57:49,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:50,133 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 12:57:50,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398765246] [2019-12-18 12:57:50,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:50,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:57:50,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692222479] [2019-12-18 12:57:50,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:57:50,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:50,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:57:50,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:57:50,137 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-18 12:57:55,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:55,443 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-18 12:57:55,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:57:55,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:57:55,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:55,990 INFO L225 Difference]: With dead ends: 172022 [2019-12-18 12:57:55,990 INFO L226 Difference]: Without dead ends: 171924 [2019-12-18 12:57:55,991 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 12:58:04,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-18 12:58:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-18 12:58:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-18 12:58:08,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-18 12:58:08,570 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-18 12:58:08,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:08,571 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-18 12:58:08,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:58:08,571 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-18 12:58:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:58:08,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:08,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:08,580 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 12:58:08,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:08,580 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-18 12:58:08,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:08,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802737207] [2019-12-18 12:58:08,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:08,659 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 12:58:08,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802737207] [2019-12-18 12:58:08,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:08,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:58:08,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156844825] [2019-12-18 12:58:08,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:58:08,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:08,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:58:08,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:08,662 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-18 12:58:08,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:08,809 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-18 12:58:08,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:58:08,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:58:08,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:08,878 INFO L225 Difference]: With dead ends: 33388 [2019-12-18 12:58:08,878 INFO L226 Difference]: Without dead ends: 33388 [2019-12-18 12:58:08,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:09,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-18 12:58:14,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-18 12:58:14,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-18 12:58:14,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-18 12:58:14,377 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-18 12:58:14,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:14,377 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-18 12:58:14,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:58:14,377 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-18 12:58:14,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:58:14,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:14,381 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:14,382 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 12:58:14,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:14,382 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-18 12:58:14,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:14,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868632556] [2019-12-18 12:58:14,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:14,452 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 12:58:14,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868632556] [2019-12-18 12:58:14,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:14,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:58:14,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333688841] [2019-12-18 12:58:14,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:58:14,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:14,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:58:14,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:14,458 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-18 12:58:14,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:14,676 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-18 12:58:14,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:58:14,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 12:58:14,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:14,774 INFO L225 Difference]: With dead ends: 52822 [2019-12-18 12:58:14,774 INFO L226 Difference]: Without dead ends: 52822 [2019-12-18 12:58:14,775 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 12:58:14,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-18 12:58:15,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-18 12:58:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-18 12:58:15,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-18 12:58:15,532 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-18 12:58:15,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:15,533 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-18 12:58:15,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:58:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-18 12:58:15,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:58:15,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:15,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:15,537 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 12:58:15,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:15,538 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-18 12:58:15,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:15,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251462621] [2019-12-18 12:58:15,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:15,609 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 12:58:15,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251462621] [2019-12-18 12:58:15,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:15,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:58:15,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524514422] [2019-12-18 12:58:15,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:58:15,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:15,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:58:15,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:58:15,611 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-18 12:58:16,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:16,452 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-18 12:58:16,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:58:16,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:58:16,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:16,523 INFO L225 Difference]: With dead ends: 46903 [2019-12-18 12:58:16,523 INFO L226 Difference]: Without dead ends: 46903 [2019-12-18 12:58:16,524 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 12:58:16,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-18 12:58:17,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-18 12:58:17,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-18 12:58:17,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-18 12:58:17,239 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-18 12:58:17,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:17,239 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-18 12:58:17,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:58:17,240 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-18 12:58:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:58:17,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:17,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:17,243 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 12:58:17,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:17,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-18 12:58:17,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:17,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171086552] [2019-12-18 12:58:17,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:17,301 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 12:58:17,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171086552] [2019-12-18 12:58:17,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:17,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:58:17,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772269734] [2019-12-18 12:58:17,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:58:17,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:17,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:58:17,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:58:17,304 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-18 12:58:17,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:17,656 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-18 12:58:17,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:58:17,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:58:17,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:17,775 INFO L225 Difference]: With dead ends: 51478 [2019-12-18 12:58:17,776 INFO L226 Difference]: Without dead ends: 51478 [2019-12-18 12:58:17,776 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 12:58:17,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-18 12:58:19,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-18 12:58:19,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-18 12:58:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-18 12:58:19,131 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-18 12:58:19,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:19,131 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-18 12:58:19,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:58:19,131 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-18 12:58:19,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:58:19,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:19,142 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 12:58:19,142 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 12:58:19,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:19,142 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-18 12:58:19,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:19,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621684290] [2019-12-18 12:58:19,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:19,212 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 12:58:19,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621684290] [2019-12-18 12:58:19,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:19,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:58:19,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125924985] [2019-12-18 12:58:19,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:58:19,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:19,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:58:19,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:58:19,215 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-18 12:58:19,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:19,860 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-18 12:58:19,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:58:19,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:58:19,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:20,011 INFO L225 Difference]: With dead ends: 61264 [2019-12-18 12:58:20,011 INFO L226 Difference]: Without dead ends: 61250 [2019-12-18 12:58:20,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:58:20,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-18 12:58:20,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-18 12:58:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-18 12:58:20,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-18 12:58:20,868 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-18 12:58:20,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:20,868 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-18 12:58:20,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:58:20,869 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-18 12:58:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:58:20,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:20,878 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 12:58:20,878 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 12:58:20,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:20,879 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-18 12:58:20,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:20,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030221784] [2019-12-18 12:58:20,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:20,947 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 12:58:20,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030221784] [2019-12-18 12:58:20,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:20,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:58:20,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937757586] [2019-12-18 12:58:20,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:58:20,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:20,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:58:20,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:58:20,949 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-18 12:58:21,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:21,570 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-18 12:58:21,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:58:21,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:58:21,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:21,674 INFO L225 Difference]: With dead ends: 63752 [2019-12-18 12:58:21,674 INFO L226 Difference]: Without dead ends: 63738 [2019-12-18 12:58:21,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:58:22,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-18 12:58:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-18 12:58:22,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-18 12:58:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-18 12:58:22,975 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-18 12:58:22,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:22,975 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-18 12:58:22,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:58:22,975 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-18 12:58:22,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:58:22,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:22,988 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 12:58:22,988 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 12:58:22,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:22,988 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-18 12:58:22,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:22,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259177233] [2019-12-18 12:58:22,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:23,038 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 12:58:23,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259177233] [2019-12-18 12:58:23,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:23,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:58:23,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191216852] [2019-12-18 12:58:23,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:58:23,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:23,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:58:23,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:58:23,040 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-18 12:58:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:23,112 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-18 12:58:23,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:58:23,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:58:23,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:23,143 INFO L225 Difference]: With dead ends: 17193 [2019-12-18 12:58:23,143 INFO L226 Difference]: Without dead ends: 17193 [2019-12-18 12:58:23,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:58:23,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-18 12:58:23,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-18 12:58:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-18 12:58:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-18 12:58:23,394 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-18 12:58:23,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:23,394 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-18 12:58:23,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:58:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-18 12:58:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 12:58:23,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:23,408 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] [2019-12-18 12:58:23,408 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 12:58:23,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:23,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-18 12:58:23,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:23,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571675124] [2019-12-18 12:58:23,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:23,476 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 12:58:23,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571675124] [2019-12-18 12:58:23,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:23,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:58:23,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87654271] [2019-12-18 12:58:23,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:58:23,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:23,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:58:23,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:58:23,479 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-18 12:58:23,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:23,799 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-18 12:58:23,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:58:23,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 12:58:23,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:23,829 INFO L225 Difference]: With dead ends: 21613 [2019-12-18 12:58:23,829 INFO L226 Difference]: Without dead ends: 21613 [2019-12-18 12:58:23,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:58:23,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-18 12:58:24,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-18 12:58:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-18 12:58:24,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-18 12:58:24,127 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-18 12:58:24,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:24,127 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-18 12:58:24,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:58:24,127 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-18 12:58:24,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:58:24,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:24,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:24,143 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 12:58:24,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:24,144 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-18 12:58:24,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:24,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201953631] [2019-12-18 12:58:24,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:24,209 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 12:58:24,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201953631] [2019-12-18 12:58:24,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:24,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:58:24,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132813028] [2019-12-18 12:58:24,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:58:24,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:24,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:58:24,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:58:24,211 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-18 12:58:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:24,580 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-18 12:58:24,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:58:24,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:58:24,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:24,631 INFO L225 Difference]: With dead ends: 23624 [2019-12-18 12:58:24,632 INFO L226 Difference]: Without dead ends: 23624 [2019-12-18 12:58:24,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:58:24,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-18 12:58:25,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-18 12:58:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-18 12:58:25,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-18 12:58:25,284 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-18 12:58:25,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:25,284 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-18 12:58:25,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:58:25,284 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-18 12:58:25,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 12:58:25,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:25,304 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] [2019-12-18 12:58:25,305 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 12:58:25,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:25,305 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-18 12:58:25,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:25,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871277249] [2019-12-18 12:58:25,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:25,397 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 12:58:25,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871277249] [2019-12-18 12:58:25,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:25,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:58:25,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23204610] [2019-12-18 12:58:25,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:58:25,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:25,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:58:25,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:58:25,399 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-18 12:58:26,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:26,066 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-18 12:58:26,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:58:26,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 12:58:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:26,107 INFO L225 Difference]: With dead ends: 27031 [2019-12-18 12:58:26,107 INFO L226 Difference]: Without dead ends: 27031 [2019-12-18 12:58:26,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:58:26,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-18 12:58:26,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-18 12:58:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-18 12:58:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-18 12:58:26,458 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-18 12:58:26,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:26,459 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-18 12:58:26,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:58:26,459 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-18 12:58:26,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:58:26,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:26,481 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:26,481 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 12:58:26,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:26,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-18 12:58:26,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:26,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515842141] [2019-12-18 12:58:26,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:26,551 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 12:58:26,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515842141] [2019-12-18 12:58:26,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:26,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:58:26,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482728997] [2019-12-18 12:58:26,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:58:26,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:26,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:58:26,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:58:26,553 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 6 states. [2019-12-18 12:58:27,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:27,193 INFO L93 Difference]: Finished difference Result 26334 states and 78684 transitions. [2019-12-18 12:58:27,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:58:27,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 12:58:27,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:27,230 INFO L225 Difference]: With dead ends: 26334 [2019-12-18 12:58:27,231 INFO L226 Difference]: Without dead ends: 26334 [2019-12-18 12:58:27,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:58:27,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26334 states. [2019-12-18 12:58:27,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26334 to 17642. [2019-12-18 12:58:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17642 states. [2019-12-18 12:58:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17642 states to 17642 states and 53957 transitions. [2019-12-18 12:58:27,541 INFO L78 Accepts]: Start accepts. Automaton has 17642 states and 53957 transitions. Word has length 34 [2019-12-18 12:58:27,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:27,542 INFO L462 AbstractCegarLoop]: Abstraction has 17642 states and 53957 transitions. [2019-12-18 12:58:27,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:58:27,542 INFO L276 IsEmpty]: Start isEmpty. Operand 17642 states and 53957 transitions. [2019-12-18 12:58:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:58:27,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:27,559 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 12:58:27,559 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 12:58:27,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:27,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-18 12:58:27,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:27,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071834473] [2019-12-18 12:58:27,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:27,618 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 12:58:27,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071834473] [2019-12-18 12:58:27,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:27,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:58:27,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347876595] [2019-12-18 12:58:27,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:58:27,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:27,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:58:27,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:27,620 INFO L87 Difference]: Start difference. First operand 17642 states and 53957 transitions. Second operand 3 states. [2019-12-18 12:58:27,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:27,690 INFO L93 Difference]: Finished difference Result 17641 states and 53955 transitions. [2019-12-18 12:58:27,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:58:27,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:58:27,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:27,723 INFO L225 Difference]: With dead ends: 17641 [2019-12-18 12:58:27,723 INFO L226 Difference]: Without dead ends: 17641 [2019-12-18 12:58:27,724 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 12:58:27,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17641 states. [2019-12-18 12:58:27,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17641 to 17641. [2019-12-18 12:58:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17641 states. [2019-12-18 12:58:27,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 53955 transitions. [2019-12-18 12:58:28,000 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 53955 transitions. Word has length 39 [2019-12-18 12:58:28,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:28,000 INFO L462 AbstractCegarLoop]: Abstraction has 17641 states and 53955 transitions. [2019-12-18 12:58:28,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:58:28,000 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 53955 transitions. [2019-12-18 12:58:28,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:58:28,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:28,019 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 12:58:28,019 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 12:58:28,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:28,019 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-18 12:58:28,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:28,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67519222] [2019-12-18 12:58:28,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:28,096 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 12:58:28,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67519222] [2019-12-18 12:58:28,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:28,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:58:28,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584734934] [2019-12-18 12:58:28,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:58:28,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:28,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:58:28,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:58:28,098 INFO L87 Difference]: Start difference. First operand 17641 states and 53955 transitions. Second operand 5 states. [2019-12-18 12:58:28,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:28,921 INFO L93 Difference]: Finished difference Result 25346 states and 76639 transitions. [2019-12-18 12:58:28,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:58:28,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:58:28,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:28,967 INFO L225 Difference]: With dead ends: 25346 [2019-12-18 12:58:28,967 INFO L226 Difference]: Without dead ends: 25346 [2019-12-18 12:58:28,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 12:58:29,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2019-12-18 12:58:29,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 23560. [2019-12-18 12:58:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23560 states. [2019-12-18 12:58:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23560 states to 23560 states and 71751 transitions. [2019-12-18 12:58:29,302 INFO L78 Accepts]: Start accepts. Automaton has 23560 states and 71751 transitions. Word has length 40 [2019-12-18 12:58:29,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:29,302 INFO L462 AbstractCegarLoop]: Abstraction has 23560 states and 71751 transitions. [2019-12-18 12:58:29,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:58:29,302 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 71751 transitions. [2019-12-18 12:58:29,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:58:29,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:29,331 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 12:58:29,331 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 12:58:29,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:29,331 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-18 12:58:29,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:29,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275418274] [2019-12-18 12:58:29,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:29,391 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 12:58:29,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275418274] [2019-12-18 12:58:29,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:29,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:58:29,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322377330] [2019-12-18 12:58:29,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:58:29,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:29,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:58:29,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:58:29,393 INFO L87 Difference]: Start difference. First operand 23560 states and 71751 transitions. Second operand 5 states. [2019-12-18 12:58:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:29,523 INFO L93 Difference]: Finished difference Result 22175 states and 68518 transitions. [2019-12-18 12:58:29,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:58:29,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:58:29,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:29,574 INFO L225 Difference]: With dead ends: 22175 [2019-12-18 12:58:29,574 INFO L226 Difference]: Without dead ends: 22175 [2019-12-18 12:58:29,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:58:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22175 states. [2019-12-18 12:58:30,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22175 to 21251. [2019-12-18 12:58:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21251 states. [2019-12-18 12:58:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21251 states to 21251 states and 66025 transitions. [2019-12-18 12:58:30,087 INFO L78 Accepts]: Start accepts. Automaton has 21251 states and 66025 transitions. Word has length 40 [2019-12-18 12:58:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:30,087 INFO L462 AbstractCegarLoop]: Abstraction has 21251 states and 66025 transitions. [2019-12-18 12:58:30,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:58:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 21251 states and 66025 transitions. [2019-12-18 12:58:30,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:30,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:30,118 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] [2019-12-18 12:58:30,118 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 12:58:30,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:30,118 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-18 12:58:30,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:30,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197539368] [2019-12-18 12:58:30,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:30,226 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 12:58:30,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197539368] [2019-12-18 12:58:30,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:30,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:58:30,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344818948] [2019-12-18 12:58:30,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:58:30,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:30,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:58:30,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:58:30,229 INFO L87 Difference]: Start difference. First operand 21251 states and 66025 transitions. Second operand 7 states. [2019-12-18 12:58:30,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:30,799 INFO L93 Difference]: Finished difference Result 62478 states and 192933 transitions. [2019-12-18 12:58:30,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 12:58:30,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:58:30,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:30,873 INFO L225 Difference]: With dead ends: 62478 [2019-12-18 12:58:30,873 INFO L226 Difference]: Without dead ends: 47634 [2019-12-18 12:58:30,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:58:31,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47634 states. [2019-12-18 12:58:31,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47634 to 25007. [2019-12-18 12:58:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25007 states. [2019-12-18 12:58:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25007 states to 25007 states and 78146 transitions. [2019-12-18 12:58:31,433 INFO L78 Accepts]: Start accepts. Automaton has 25007 states and 78146 transitions. Word has length 63 [2019-12-18 12:58:31,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:31,433 INFO L462 AbstractCegarLoop]: Abstraction has 25007 states and 78146 transitions. [2019-12-18 12:58:31,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:58:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 25007 states and 78146 transitions. [2019-12-18 12:58:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:31,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:31,463 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] [2019-12-18 12:58:31,463 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 12:58:31,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:31,463 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-18 12:58:31,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:31,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213982101] [2019-12-18 12:58:31,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:31,554 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 12:58:31,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213982101] [2019-12-18 12:58:31,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:31,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:58:31,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510035037] [2019-12-18 12:58:31,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:58:31,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:31,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:58:31,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:58:31,556 INFO L87 Difference]: Start difference. First operand 25007 states and 78146 transitions. Second operand 7 states. [2019-12-18 12:58:32,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:32,079 INFO L93 Difference]: Finished difference Result 68433 states and 210070 transitions. [2019-12-18 12:58:32,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:58:32,080 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:58:32,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:32,494 INFO L225 Difference]: With dead ends: 68433 [2019-12-18 12:58:32,494 INFO L226 Difference]: Without dead ends: 48478 [2019-12-18 12:58:32,495 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 12:58:32,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48478 states. [2019-12-18 12:58:33,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48478 to 28798. [2019-12-18 12:58:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2019-12-18 12:58:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 89643 transitions. [2019-12-18 12:58:33,062 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 89643 transitions. Word has length 63 [2019-12-18 12:58:33,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:33,062 INFO L462 AbstractCegarLoop]: Abstraction has 28798 states and 89643 transitions. [2019-12-18 12:58:33,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:58:33,063 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 89643 transitions. [2019-12-18 12:58:33,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:33,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:33,096 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] [2019-12-18 12:58:33,097 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 12:58:33,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:33,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-18 12:58:33,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:33,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261730072] [2019-12-18 12:58:33,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:33,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261730072] [2019-12-18 12:58:33,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:33,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:58:33,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149053738] [2019-12-18 12:58:33,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:58:33,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:33,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:58:33,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:58:33,179 INFO L87 Difference]: Start difference. First operand 28798 states and 89643 transitions. Second operand 7 states. [2019-12-18 12:58:33,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:33,778 INFO L93 Difference]: Finished difference Result 59843 states and 183697 transitions. [2019-12-18 12:58:33,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:58:33,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:58:33,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:33,891 INFO L225 Difference]: With dead ends: 59843 [2019-12-18 12:58:33,891 INFO L226 Difference]: Without dead ends: 52762 [2019-12-18 12:58:33,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:58:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52762 states. [2019-12-18 12:58:34,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52762 to 29106. [2019-12-18 12:58:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29106 states. [2019-12-18 12:58:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29106 states to 29106 states and 90594 transitions. [2019-12-18 12:58:34,518 INFO L78 Accepts]: Start accepts. Automaton has 29106 states and 90594 transitions. Word has length 63 [2019-12-18 12:58:34,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:34,518 INFO L462 AbstractCegarLoop]: Abstraction has 29106 states and 90594 transitions. [2019-12-18 12:58:34,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:58:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 29106 states and 90594 transitions. [2019-12-18 12:58:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:34,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:34,549 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] [2019-12-18 12:58:34,549 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 12:58:34,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:34,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-18 12:58:34,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:34,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654272700] [2019-12-18 12:58:34,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:34,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:34,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654272700] [2019-12-18 12:58:34,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:34,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:58:34,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321470279] [2019-12-18 12:58:34,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:58:34,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:34,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:58:34,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:58:34,663 INFO L87 Difference]: Start difference. First operand 29106 states and 90594 transitions. Second operand 7 states. [2019-12-18 12:58:35,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:35,718 INFO L93 Difference]: Finished difference Result 38094 states and 116230 transitions. [2019-12-18 12:58:35,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:58:35,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:58:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:35,775 INFO L225 Difference]: With dead ends: 38094 [2019-12-18 12:58:35,776 INFO L226 Difference]: Without dead ends: 37870 [2019-12-18 12:58:35,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:58:35,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37870 states. [2019-12-18 12:58:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37870 to 31894. [2019-12-18 12:58:36,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31894 states. [2019-12-18 12:58:36,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31894 states to 31894 states and 98893 transitions. [2019-12-18 12:58:36,615 INFO L78 Accepts]: Start accepts. Automaton has 31894 states and 98893 transitions. Word has length 63 [2019-12-18 12:58:36,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:36,615 INFO L462 AbstractCegarLoop]: Abstraction has 31894 states and 98893 transitions. [2019-12-18 12:58:36,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:58:36,615 INFO L276 IsEmpty]: Start isEmpty. Operand 31894 states and 98893 transitions. [2019-12-18 12:58:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:36,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:36,651 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:58:36,651 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 12:58:36,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:36,651 INFO L82 PathProgramCache]: Analyzing trace with hash 232911163, now seen corresponding path program 5 times [2019-12-18 12:58:36,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:36,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126109439] [2019-12-18 12:58:36,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:36,774 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 12:58:36,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126109439] [2019-12-18 12:58:36,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:36,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:58:36,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293550977] [2019-12-18 12:58:36,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:58:36,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:36,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:58:36,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:58:36,776 INFO L87 Difference]: Start difference. First operand 31894 states and 98893 transitions. Second operand 7 states. [2019-12-18 12:58:38,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:38,240 INFO L93 Difference]: Finished difference Result 54976 states and 166682 transitions. [2019-12-18 12:58:38,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 12:58:38,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:58:38,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:38,326 INFO L225 Difference]: With dead ends: 54976 [2019-12-18 12:58:38,326 INFO L226 Difference]: Without dead ends: 54653 [2019-12-18 12:58:38,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:58:38,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54653 states. [2019-12-18 12:58:38,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54653 to 34658. [2019-12-18 12:58:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34658 states. [2019-12-18 12:58:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34658 states to 34658 states and 107721 transitions. [2019-12-18 12:58:39,010 INFO L78 Accepts]: Start accepts. Automaton has 34658 states and 107721 transitions. Word has length 63 [2019-12-18 12:58:39,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:39,011 INFO L462 AbstractCegarLoop]: Abstraction has 34658 states and 107721 transitions. [2019-12-18 12:58:39,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:58:39,011 INFO L276 IsEmpty]: Start isEmpty. Operand 34658 states and 107721 transitions. [2019-12-18 12:58:39,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:39,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:39,052 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] [2019-12-18 12:58:39,052 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 12:58:39,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:39,052 INFO L82 PathProgramCache]: Analyzing trace with hash 908177687, now seen corresponding path program 6 times [2019-12-18 12:58:39,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:39,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960205671] [2019-12-18 12:58:39,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:39,192 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 12:58:39,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960205671] [2019-12-18 12:58:39,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:39,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:58:39,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081323297] [2019-12-18 12:58:39,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:58:39,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:39,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:58:39,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:58:39,195 INFO L87 Difference]: Start difference. First operand 34658 states and 107721 transitions. Second operand 7 states. [2019-12-18 12:58:40,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:40,268 INFO L93 Difference]: Finished difference Result 57288 states and 175480 transitions. [2019-12-18 12:58:40,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:58:40,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:58:40,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:40,384 INFO L225 Difference]: With dead ends: 57288 [2019-12-18 12:58:40,384 INFO L226 Difference]: Without dead ends: 57068 [2019-12-18 12:58:40,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:58:40,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57068 states. [2019-12-18 12:58:41,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57068 to 40390. [2019-12-18 12:58:41,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40390 states. [2019-12-18 12:58:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40390 states to 40390 states and 125252 transitions. [2019-12-18 12:58:41,516 INFO L78 Accepts]: Start accepts. Automaton has 40390 states and 125252 transitions. Word has length 63 [2019-12-18 12:58:41,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:41,517 INFO L462 AbstractCegarLoop]: Abstraction has 40390 states and 125252 transitions. [2019-12-18 12:58:41,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:58:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 40390 states and 125252 transitions. [2019-12-18 12:58:41,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:41,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:41,569 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] [2019-12-18 12:58:41,569 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 12:58:41,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:41,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1577046585, now seen corresponding path program 7 times [2019-12-18 12:58:41,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:41,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339114826] [2019-12-18 12:58:41,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:41,714 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 12:58:41,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339114826] [2019-12-18 12:58:41,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:41,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:58:41,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873749560] [2019-12-18 12:58:41,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:58:41,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:41,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:58:41,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:58:41,716 INFO L87 Difference]: Start difference. First operand 40390 states and 125252 transitions. Second operand 9 states. [2019-12-18 12:58:42,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:42,976 INFO L93 Difference]: Finished difference Result 60008 states and 183321 transitions. [2019-12-18 12:58:42,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:58:42,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-18 12:58:42,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:43,066 INFO L225 Difference]: With dead ends: 60008 [2019-12-18 12:58:43,066 INFO L226 Difference]: Without dead ends: 59756 [2019-12-18 12:58:43,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-18 12:58:43,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59756 states. [2019-12-18 12:58:43,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59756 to 40339. [2019-12-18 12:58:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40339 states. [2019-12-18 12:58:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40339 states to 40339 states and 125109 transitions. [2019-12-18 12:58:43,835 INFO L78 Accepts]: Start accepts. Automaton has 40339 states and 125109 transitions. Word has length 63 [2019-12-18 12:58:43,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:43,836 INFO L462 AbstractCegarLoop]: Abstraction has 40339 states and 125109 transitions. [2019-12-18 12:58:43,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:58:43,836 INFO L276 IsEmpty]: Start isEmpty. Operand 40339 states and 125109 transitions. [2019-12-18 12:58:43,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:43,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:43,885 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] [2019-12-18 12:58:43,885 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 12:58:43,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:43,885 INFO L82 PathProgramCache]: Analyzing trace with hash 593914995, now seen corresponding path program 8 times [2019-12-18 12:58:43,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:43,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687244044] [2019-12-18 12:58:43,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:43,991 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 12:58:43,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687244044] [2019-12-18 12:58:43,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:43,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:58:43,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887554114] [2019-12-18 12:58:43,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:58:43,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:43,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:58:43,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:58:43,993 INFO L87 Difference]: Start difference. First operand 40339 states and 125109 transitions. Second operand 8 states. [2019-12-18 12:58:45,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:45,911 INFO L93 Difference]: Finished difference Result 58458 states and 177165 transitions. [2019-12-18 12:58:45,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:58:45,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 12:58:45,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:46,003 INFO L225 Difference]: With dead ends: 58458 [2019-12-18 12:58:46,003 INFO L226 Difference]: Without dead ends: 58458 [2019-12-18 12:58:46,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:58:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58458 states. [2019-12-18 12:58:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58458 to 39692. [2019-12-18 12:58:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39692 states. [2019-12-18 12:58:47,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39692 states to 39692 states and 123217 transitions. [2019-12-18 12:58:47,131 INFO L78 Accepts]: Start accepts. Automaton has 39692 states and 123217 transitions. Word has length 63 [2019-12-18 12:58:47,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:47,131 INFO L462 AbstractCegarLoop]: Abstraction has 39692 states and 123217 transitions. [2019-12-18 12:58:47,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:58:47,131 INFO L276 IsEmpty]: Start isEmpty. Operand 39692 states and 123217 transitions. [2019-12-18 12:58:47,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:47,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:47,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] [2019-12-18 12:58:47,189 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 12:58:47,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:47,190 INFO L82 PathProgramCache]: Analyzing trace with hash 194134925, now seen corresponding path program 9 times [2019-12-18 12:58:47,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:47,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976358232] [2019-12-18 12:58:47,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:47,329 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 12:58:47,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976358232] [2019-12-18 12:58:47,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:47,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:58:47,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849380936] [2019-12-18 12:58:47,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:58:47,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:47,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:58:47,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:58:47,331 INFO L87 Difference]: Start difference. First operand 39692 states and 123217 transitions. Second operand 9 states. [2019-12-18 12:58:48,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:48,462 INFO L93 Difference]: Finished difference Result 55159 states and 169085 transitions. [2019-12-18 12:58:48,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 12:58:48,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-18 12:58:48,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:48,548 INFO L225 Difference]: With dead ends: 55159 [2019-12-18 12:58:48,549 INFO L226 Difference]: Without dead ends: 55159 [2019-12-18 12:58:48,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:58:48,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55159 states. [2019-12-18 12:58:49,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55159 to 38889. [2019-12-18 12:58:49,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38889 states. [2019-12-18 12:58:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38889 states to 38889 states and 120766 transitions. [2019-12-18 12:58:49,299 INFO L78 Accepts]: Start accepts. Automaton has 38889 states and 120766 transitions. Word has length 63 [2019-12-18 12:58:49,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:49,300 INFO L462 AbstractCegarLoop]: Abstraction has 38889 states and 120766 transitions. [2019-12-18 12:58:49,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:58:49,300 INFO L276 IsEmpty]: Start isEmpty. Operand 38889 states and 120766 transitions. [2019-12-18 12:58:49,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:49,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:49,346 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] [2019-12-18 12:58:49,347 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 12:58:49,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:49,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1930988027, now seen corresponding path program 10 times [2019-12-18 12:58:49,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:49,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523820261] [2019-12-18 12:58:49,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:49,481 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 12:58:49,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523820261] [2019-12-18 12:58:49,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:49,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:58:49,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334061997] [2019-12-18 12:58:49,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:58:49,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:49,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:58:49,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:58:49,484 INFO L87 Difference]: Start difference. First operand 38889 states and 120766 transitions. Second operand 10 states. [2019-12-18 12:58:51,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:51,407 INFO L93 Difference]: Finished difference Result 56103 states and 171957 transitions. [2019-12-18 12:58:51,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:58:51,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-12-18 12:58:51,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:51,494 INFO L225 Difference]: With dead ends: 56103 [2019-12-18 12:58:51,495 INFO L226 Difference]: Without dead ends: 56103 [2019-12-18 12:58:51,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:58:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56103 states. [2019-12-18 12:58:52,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56103 to 36616. [2019-12-18 12:58:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36616 states. [2019-12-18 12:58:52,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36616 states to 36616 states and 113998 transitions. [2019-12-18 12:58:52,191 INFO L78 Accepts]: Start accepts. Automaton has 36616 states and 113998 transitions. Word has length 63 [2019-12-18 12:58:52,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:52,192 INFO L462 AbstractCegarLoop]: Abstraction has 36616 states and 113998 transitions. [2019-12-18 12:58:52,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:58:52,192 INFO L276 IsEmpty]: Start isEmpty. Operand 36616 states and 113998 transitions. [2019-12-18 12:58:52,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:52,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:52,234 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] [2019-12-18 12:58:52,234 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 12:58:52,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:52,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1638823163, now seen corresponding path program 11 times [2019-12-18 12:58:52,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:52,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665574517] [2019-12-18 12:58:52,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:52,326 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 12:58:52,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665574517] [2019-12-18 12:58:52,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:52,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:58:52,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186323298] [2019-12-18 12:58:52,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:58:52,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:52,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:58:52,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:58:52,328 INFO L87 Difference]: Start difference. First operand 36616 states and 113998 transitions. Second operand 7 states. [2019-12-18 12:58:53,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:53,161 INFO L93 Difference]: Finished difference Result 57418 states and 175676 transitions. [2019-12-18 12:58:53,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:58:53,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:58:53,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:53,253 INFO L225 Difference]: With dead ends: 57418 [2019-12-18 12:58:53,253 INFO L226 Difference]: Without dead ends: 57418 [2019-12-18 12:58:53,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:58:53,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57418 states. [2019-12-18 12:58:53,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57418 to 39035. [2019-12-18 12:58:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39035 states. [2019-12-18 12:58:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39035 states to 39035 states and 121312 transitions. [2019-12-18 12:58:54,011 INFO L78 Accepts]: Start accepts. Automaton has 39035 states and 121312 transitions. Word has length 63 [2019-12-18 12:58:54,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:54,011 INFO L462 AbstractCegarLoop]: Abstraction has 39035 states and 121312 transitions. [2019-12-18 12:58:54,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:58:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 39035 states and 121312 transitions. [2019-12-18 12:58:54,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:54,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:54,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:58:54,058 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 12:58:54,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:54,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1952090881, now seen corresponding path program 12 times [2019-12-18 12:58:54,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:54,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648217718] [2019-12-18 12:58:54,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:54,209 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 12:58:54,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648217718] [2019-12-18 12:58:54,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:54,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:58:54,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299957294] [2019-12-18 12:58:54,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:58:54,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:54,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:58:54,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:58:54,211 INFO L87 Difference]: Start difference. First operand 39035 states and 121312 transitions. Second operand 8 states. [2019-12-18 12:58:55,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:55,379 INFO L93 Difference]: Finished difference Result 54712 states and 167584 transitions. [2019-12-18 12:58:55,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:58:55,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 12:58:55,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:55,464 INFO L225 Difference]: With dead ends: 54712 [2019-12-18 12:58:55,464 INFO L226 Difference]: Without dead ends: 54656 [2019-12-18 12:58:55,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:58:55,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54656 states. [2019-12-18 12:58:56,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54656 to 38782. [2019-12-18 12:58:56,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38782 states. [2019-12-18 12:58:56,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38782 states to 38782 states and 119649 transitions. [2019-12-18 12:58:56,521 INFO L78 Accepts]: Start accepts. Automaton has 38782 states and 119649 transitions. Word has length 63 [2019-12-18 12:58:56,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:56,521 INFO L462 AbstractCegarLoop]: Abstraction has 38782 states and 119649 transitions. [2019-12-18 12:58:56,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:58:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 38782 states and 119649 transitions. [2019-12-18 12:58:56,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:56,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:56,565 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] [2019-12-18 12:58:56,565 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 12:58:56,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:56,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1981956519, now seen corresponding path program 13 times [2019-12-18 12:58:56,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:56,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989776133] [2019-12-18 12:58:56,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:56,677 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 12:58:56,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989776133] [2019-12-18 12:58:56,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:56,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:58:56,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550085692] [2019-12-18 12:58:56,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:58:56,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:56,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:58:56,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:58:56,679 INFO L87 Difference]: Start difference. First operand 38782 states and 119649 transitions. Second operand 8 states. [2019-12-18 12:58:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:58,513 INFO L93 Difference]: Finished difference Result 67452 states and 202956 transitions. [2019-12-18 12:58:58,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:58:58,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 12:58:58,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:58,610 INFO L225 Difference]: With dead ends: 67452 [2019-12-18 12:58:58,610 INFO L226 Difference]: Without dead ends: 67452 [2019-12-18 12:58:58,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:58:58,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67452 states. [2019-12-18 12:58:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67452 to 38529. [2019-12-18 12:58:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38529 states. [2019-12-18 12:58:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38529 states to 38529 states and 119032 transitions. [2019-12-18 12:58:59,423 INFO L78 Accepts]: Start accepts. Automaton has 38529 states and 119032 transitions. Word has length 63 [2019-12-18 12:58:59,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:59,424 INFO L462 AbstractCegarLoop]: Abstraction has 38529 states and 119032 transitions. [2019-12-18 12:58:59,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:58:59,424 INFO L276 IsEmpty]: Start isEmpty. Operand 38529 states and 119032 transitions. [2019-12-18 12:58:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:59,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:59,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:58:59,466 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 12:58:59,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:59,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1727739179, now seen corresponding path program 14 times [2019-12-18 12:58:59,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:59,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165781726] [2019-12-18 12:58:59,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:59,619 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 12:58:59,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165781726] [2019-12-18 12:58:59,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:59,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:58:59,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716087147] [2019-12-18 12:58:59,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:58:59,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:59,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:58:59,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:58:59,621 INFO L87 Difference]: Start difference. First operand 38529 states and 119032 transitions. Second operand 8 states. [2019-12-18 12:59:00,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:00,628 INFO L93 Difference]: Finished difference Result 57559 states and 175436 transitions. [2019-12-18 12:59:00,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:59:00,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 12:59:00,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:00,715 INFO L225 Difference]: With dead ends: 57559 [2019-12-18 12:59:00,715 INFO L226 Difference]: Without dead ends: 57559 [2019-12-18 12:59:00,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:59:01,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57559 states. [2019-12-18 12:59:01,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57559 to 37418. [2019-12-18 12:59:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37418 states. [2019-12-18 12:59:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37418 states to 37418 states and 115770 transitions. [2019-12-18 12:59:01,767 INFO L78 Accepts]: Start accepts. Automaton has 37418 states and 115770 transitions. Word has length 63 [2019-12-18 12:59:01,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:01,767 INFO L462 AbstractCegarLoop]: Abstraction has 37418 states and 115770 transitions. [2019-12-18 12:59:01,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:59:01,767 INFO L276 IsEmpty]: Start isEmpty. Operand 37418 states and 115770 transitions. [2019-12-18 12:59:01,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:59:01,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:01,809 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] [2019-12-18 12:59:01,809 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 12:59:01,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:01,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1876409601, now seen corresponding path program 15 times [2019-12-18 12:59:01,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:01,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801727099] [2019-12-18 12:59:01,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:01,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801727099] [2019-12-18 12:59:01,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:01,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:59:01,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673088139] [2019-12-18 12:59:01,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:59:01,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:01,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:59:01,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:59:01,897 INFO L87 Difference]: Start difference. First operand 37418 states and 115770 transitions. Second operand 7 states. [2019-12-18 12:59:02,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:02,968 INFO L93 Difference]: Finished difference Result 55724 states and 170978 transitions. [2019-12-18 12:59:02,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 12:59:02,973 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:59:02,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:03,069 INFO L225 Difference]: With dead ends: 55724 [2019-12-18 12:59:03,069 INFO L226 Difference]: Without dead ends: 55724 [2019-12-18 12:59:03,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:59:03,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55724 states. [2019-12-18 12:59:03,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55724 to 39999. [2019-12-18 12:59:03,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39999 states. [2019-12-18 12:59:03,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39999 states to 39999 states and 123988 transitions. [2019-12-18 12:59:03,800 INFO L78 Accepts]: Start accepts. Automaton has 39999 states and 123988 transitions. Word has length 63 [2019-12-18 12:59:03,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:03,801 INFO L462 AbstractCegarLoop]: Abstraction has 39999 states and 123988 transitions. [2019-12-18 12:59:03,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:59:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 39999 states and 123988 transitions. [2019-12-18 12:59:03,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:59:03,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:03,846 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] [2019-12-18 12:59:03,846 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 12:59:03,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:03,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1937295543, now seen corresponding path program 16 times [2019-12-18 12:59:03,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:03,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451541030] [2019-12-18 12:59:03,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:03,960 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 12:59:03,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451541030] [2019-12-18 12:59:03,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:03,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:59:03,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809700128] [2019-12-18 12:59:03,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:59:03,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:03,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:59:03,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:59:03,963 INFO L87 Difference]: Start difference. First operand 39999 states and 123988 transitions. Second operand 8 states. [2019-12-18 12:59:05,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:05,228 INFO L93 Difference]: Finished difference Result 61056 states and 186419 transitions. [2019-12-18 12:59:05,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:59:05,228 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 12:59:05,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:05,335 INFO L225 Difference]: With dead ends: 61056 [2019-12-18 12:59:05,335 INFO L226 Difference]: Without dead ends: 61056 [2019-12-18 12:59:05,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:59:05,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61056 states. [2019-12-18 12:59:06,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61056 to 40797. [2019-12-18 12:59:06,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40797 states. [2019-12-18 12:59:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40797 states to 40797 states and 126265 transitions. [2019-12-18 12:59:06,513 INFO L78 Accepts]: Start accepts. Automaton has 40797 states and 126265 transitions. Word has length 63 [2019-12-18 12:59:06,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:06,513 INFO L462 AbstractCegarLoop]: Abstraction has 40797 states and 126265 transitions. [2019-12-18 12:59:06,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:59:06,513 INFO L276 IsEmpty]: Start isEmpty. Operand 40797 states and 126265 transitions. [2019-12-18 12:59:06,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:59:06,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:06,559 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] [2019-12-18 12:59:06,559 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 12:59:06,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:06,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1351537083, now seen corresponding path program 17 times [2019-12-18 12:59:06,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:06,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453838896] [2019-12-18 12:59:06,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:06,714 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 12:59:06,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453838896] [2019-12-18 12:59:06,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:06,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:59:06,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113199678] [2019-12-18 12:59:06,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:59:06,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:06,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:59:06,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:59:06,716 INFO L87 Difference]: Start difference. First operand 40797 states and 126265 transitions. Second operand 10 states. [2019-12-18 12:59:08,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:08,101 INFO L93 Difference]: Finished difference Result 61113 states and 186560 transitions. [2019-12-18 12:59:08,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:59:08,102 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-12-18 12:59:08,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:08,198 INFO L225 Difference]: With dead ends: 61113 [2019-12-18 12:59:08,198 INFO L226 Difference]: Without dead ends: 61113 [2019-12-18 12:59:08,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:59:08,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61113 states. [2019-12-18 12:59:08,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61113 to 39655. [2019-12-18 12:59:08,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39655 states. [2019-12-18 12:59:08,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39655 states to 39655 states and 122975 transitions. [2019-12-18 12:59:08,993 INFO L78 Accepts]: Start accepts. Automaton has 39655 states and 122975 transitions. Word has length 63 [2019-12-18 12:59:08,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:08,993 INFO L462 AbstractCegarLoop]: Abstraction has 39655 states and 122975 transitions. [2019-12-18 12:59:08,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:59:08,993 INFO L276 IsEmpty]: Start isEmpty. Operand 39655 states and 122975 transitions. [2019-12-18 12:59:09,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:59:09,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:09,041 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] [2019-12-18 12:59:09,041 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 12:59:09,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:09,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1012741715, now seen corresponding path program 18 times [2019-12-18 12:59:09,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:09,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531420126] [2019-12-18 12:59:09,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:09,096 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 12:59:09,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531420126] [2019-12-18 12:59:09,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:09,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:59:09,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115949622] [2019-12-18 12:59:09,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:59:09,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:09,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:59:09,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:59:09,098 INFO L87 Difference]: Start difference. First operand 39655 states and 122975 transitions. Second operand 3 states. [2019-12-18 12:59:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:09,235 INFO L93 Difference]: Finished difference Result 39654 states and 122973 transitions. [2019-12-18 12:59:09,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:59:09,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-18 12:59:09,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:09,296 INFO L225 Difference]: With dead ends: 39654 [2019-12-18 12:59:09,296 INFO L226 Difference]: Without dead ends: 39654 [2019-12-18 12:59:09,296 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 12:59:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39654 states. [2019-12-18 12:59:10,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39654 to 32690. [2019-12-18 12:59:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32690 states. [2019-12-18 12:59:10,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32690 states to 32690 states and 102235 transitions. [2019-12-18 12:59:10,304 INFO L78 Accepts]: Start accepts. Automaton has 32690 states and 102235 transitions. Word has length 63 [2019-12-18 12:59:10,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:10,304 INFO L462 AbstractCegarLoop]: Abstraction has 32690 states and 102235 transitions. [2019-12-18 12:59:10,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:59:10,304 INFO L276 IsEmpty]: Start isEmpty. Operand 32690 states and 102235 transitions. [2019-12-18 12:59:10,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:59:10,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:10,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:59:10,342 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 12:59:10,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:10,343 INFO L82 PathProgramCache]: Analyzing trace with hash 2010713375, now seen corresponding path program 1 times [2019-12-18 12:59:10,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:10,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880121966] [2019-12-18 12:59:10,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:10,428 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 12:59:10,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880121966] [2019-12-18 12:59:10,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:10,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:59:10,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594239956] [2019-12-18 12:59:10,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:59:10,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:10,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:59:10,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:59:10,430 INFO L87 Difference]: Start difference. First operand 32690 states and 102235 transitions. Second operand 4 states. [2019-12-18 12:59:10,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:10,607 INFO L93 Difference]: Finished difference Result 39229 states and 121701 transitions. [2019-12-18 12:59:10,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:59:10,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-18 12:59:10,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:10,666 INFO L225 Difference]: With dead ends: 39229 [2019-12-18 12:59:10,667 INFO L226 Difference]: Without dead ends: 39229 [2019-12-18 12:59:10,667 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 12:59:10,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39229 states. [2019-12-18 12:59:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39229 to 33143. [2019-12-18 12:59:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33143 states. [2019-12-18 12:59:11,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33143 states to 33143 states and 104132 transitions. [2019-12-18 12:59:11,222 INFO L78 Accepts]: Start accepts. Automaton has 33143 states and 104132 transitions. Word has length 64 [2019-12-18 12:59:11,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:11,222 INFO L462 AbstractCegarLoop]: Abstraction has 33143 states and 104132 transitions. [2019-12-18 12:59:11,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:59:11,222 INFO L276 IsEmpty]: Start isEmpty. Operand 33143 states and 104132 transitions. [2019-12-18 12:59:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:59:11,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:11,261 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:59:11,261 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 12:59:11,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:11,261 INFO L82 PathProgramCache]: Analyzing trace with hash 78921339, now seen corresponding path program 1 times [2019-12-18 12:59:11,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:11,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273978247] [2019-12-18 12:59:11,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:11,316 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 12:59:11,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273978247] [2019-12-18 12:59:11,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:11,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:59:11,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453094225] [2019-12-18 12:59:11,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:59:11,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:11,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:59:11,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:59:11,318 INFO L87 Difference]: Start difference. First operand 33143 states and 104132 transitions. Second operand 3 states. [2019-12-18 12:59:11,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:11,448 INFO L93 Difference]: Finished difference Result 25358 states and 78619 transitions. [2019-12-18 12:59:11,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:59:11,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:59:11,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:11,496 INFO L225 Difference]: With dead ends: 25358 [2019-12-18 12:59:11,496 INFO L226 Difference]: Without dead ends: 25358 [2019-12-18 12:59:11,496 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 12:59:11,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25358 states. [2019-12-18 12:59:11,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25358 to 23224. [2019-12-18 12:59:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23224 states. [2019-12-18 12:59:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23224 states to 23224 states and 72001 transitions. [2019-12-18 12:59:12,054 INFO L78 Accepts]: Start accepts. Automaton has 23224 states and 72001 transitions. Word has length 65 [2019-12-18 12:59:12,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:12,054 INFO L462 AbstractCegarLoop]: Abstraction has 23224 states and 72001 transitions. [2019-12-18 12:59:12,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:59:12,054 INFO L276 IsEmpty]: Start isEmpty. Operand 23224 states and 72001 transitions. [2019-12-18 12:59:12,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:59:12,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:12,089 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 12:59:12,089 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 12:59:12,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:12,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1524862519, now seen corresponding path program 1 times [2019-12-18 12:59:12,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:12,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410650220] [2019-12-18 12:59:12,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:12,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410650220] [2019-12-18 12:59:12,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:12,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:59:12,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725082835] [2019-12-18 12:59:12,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:59:12,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:12,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:59:12,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:59:12,281 INFO L87 Difference]: Start difference. First operand 23224 states and 72001 transitions. Second operand 11 states. [2019-12-18 12:59:13,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:13,536 INFO L93 Difference]: Finished difference Result 50685 states and 157517 transitions. [2019-12-18 12:59:13,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 12:59:13,536 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:59:13,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:13,606 INFO L225 Difference]: With dead ends: 50685 [2019-12-18 12:59:13,607 INFO L226 Difference]: Without dead ends: 48077 [2019-12-18 12:59:13,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 12:59:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48077 states. [2019-12-18 12:59:14,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48077 to 28277. [2019-12-18 12:59:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28277 states. [2019-12-18 12:59:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28277 states to 28277 states and 87588 transitions. [2019-12-18 12:59:14,649 INFO L78 Accepts]: Start accepts. Automaton has 28277 states and 87588 transitions. Word has length 66 [2019-12-18 12:59:14,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:14,649 INFO L462 AbstractCegarLoop]: Abstraction has 28277 states and 87588 transitions. [2019-12-18 12:59:14,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:59:14,649 INFO L276 IsEmpty]: Start isEmpty. Operand 28277 states and 87588 transitions. [2019-12-18 12:59:14,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:59:14,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:14,683 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 12:59:14,683 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 12:59:14,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:14,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1239159877, now seen corresponding path program 2 times [2019-12-18 12:59:14,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:14,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183595391] [2019-12-18 12:59:14,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:14,854 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 12:59:14,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183595391] [2019-12-18 12:59:14,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:14,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:59:14,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618941652] [2019-12-18 12:59:14,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:59:14,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:14,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:59:14,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:59:14,857 INFO L87 Difference]: Start difference. First operand 28277 states and 87588 transitions. Second operand 11 states. [2019-12-18 12:59:15,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:15,900 INFO L93 Difference]: Finished difference Result 48891 states and 150700 transitions. [2019-12-18 12:59:15,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:59:15,901 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:59:15,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:15,958 INFO L225 Difference]: With dead ends: 48891 [2019-12-18 12:59:15,958 INFO L226 Difference]: Without dead ends: 39030 [2019-12-18 12:59:15,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:59:16,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39030 states. [2019-12-18 12:59:16,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39030 to 22948. [2019-12-18 12:59:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22948 states. [2019-12-18 12:59:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22948 states to 22948 states and 70495 transitions. [2019-12-18 12:59:16,420 INFO L78 Accepts]: Start accepts. Automaton has 22948 states and 70495 transitions. Word has length 66 [2019-12-18 12:59:16,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:16,420 INFO L462 AbstractCegarLoop]: Abstraction has 22948 states and 70495 transitions. [2019-12-18 12:59:16,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:59:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 22948 states and 70495 transitions. [2019-12-18 12:59:16,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:59:16,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:16,444 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 12:59:16,444 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 12:59:16,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:16,444 INFO L82 PathProgramCache]: Analyzing trace with hash -952881413, now seen corresponding path program 3 times [2019-12-18 12:59:16,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:16,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423910573] [2019-12-18 12:59:16,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:16,934 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 12:59:16,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423910573] [2019-12-18 12:59:16,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:16,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 12:59:16,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561230977] [2019-12-18 12:59:16,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 12:59:16,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:16,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 12:59:16,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:59:16,936 INFO L87 Difference]: Start difference. First operand 22948 states and 70495 transitions. Second operand 17 states. [2019-12-18 12:59:20,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:20,237 INFO L93 Difference]: Finished difference Result 29564 states and 89297 transitions. [2019-12-18 12:59:20,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 12:59:20,238 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-18 12:59:20,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:20,280 INFO L225 Difference]: With dead ends: 29564 [2019-12-18 12:59:20,280 INFO L226 Difference]: Without dead ends: 28813 [2019-12-18 12:59:20,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=331, Invalid=1475, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 12:59:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28813 states. [2019-12-18 12:59:20,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28813 to 22864. [2019-12-18 12:59:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22864 states. [2019-12-18 12:59:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22864 states to 22864 states and 70273 transitions. [2019-12-18 12:59:20,653 INFO L78 Accepts]: Start accepts. Automaton has 22864 states and 70273 transitions. Word has length 66 [2019-12-18 12:59:20,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:20,653 INFO L462 AbstractCegarLoop]: Abstraction has 22864 states and 70273 transitions. [2019-12-18 12:59:20,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 12:59:20,653 INFO L276 IsEmpty]: Start isEmpty. Operand 22864 states and 70273 transitions. [2019-12-18 12:59:20,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:59:20,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:20,679 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 12:59:20,679 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:59:20,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:20,679 INFO L82 PathProgramCache]: Analyzing trace with hash 478387931, now seen corresponding path program 4 times [2019-12-18 12:59:20,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:20,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495156830] [2019-12-18 12:59:20,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:20,838 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 12:59:20,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495156830] [2019-12-18 12:59:20,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:20,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:59:20,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620282492] [2019-12-18 12:59:20,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:59:20,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:20,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:59:20,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:59:20,839 INFO L87 Difference]: Start difference. First operand 22864 states and 70273 transitions. Second operand 11 states. [2019-12-18 12:59:22,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:22,094 INFO L93 Difference]: Finished difference Result 25778 states and 78322 transitions. [2019-12-18 12:59:22,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 12:59:22,095 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:59:22,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:22,131 INFO L225 Difference]: With dead ends: 25778 [2019-12-18 12:59:22,131 INFO L226 Difference]: Without dead ends: 24888 [2019-12-18 12:59:22,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:59:22,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24888 states. [2019-12-18 12:59:22,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24888 to 22464. [2019-12-18 12:59:22,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22464 states. [2019-12-18 12:59:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22464 states to 22464 states and 69122 transitions. [2019-12-18 12:59:22,757 INFO L78 Accepts]: Start accepts. Automaton has 22464 states and 69122 transitions. Word has length 66 [2019-12-18 12:59:22,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:22,757 INFO L462 AbstractCegarLoop]: Abstraction has 22464 states and 69122 transitions. [2019-12-18 12:59:22,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:59:22,757 INFO L276 IsEmpty]: Start isEmpty. Operand 22464 states and 69122 transitions. [2019-12-18 12:59:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:59:22,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:22,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:22,786 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:59:22,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:22,787 INFO L82 PathProgramCache]: Analyzing trace with hash -2033523235, now seen corresponding path program 5 times [2019-12-18 12:59:22,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:22,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989691862] [2019-12-18 12:59:22,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:22,917 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 12:59:22,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989691862] [2019-12-18 12:59:22,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:22,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:59:22,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048370351] [2019-12-18 12:59:22,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:59:22,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:22,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:59:22,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:59:22,919 INFO L87 Difference]: Start difference. First operand 22464 states and 69122 transitions. Second operand 11 states. [2019-12-18 12:59:24,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:24,031 INFO L93 Difference]: Finished difference Result 26375 states and 80345 transitions. [2019-12-18 12:59:24,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:59:24,031 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:59:24,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:24,068 INFO L225 Difference]: With dead ends: 26375 [2019-12-18 12:59:24,068 INFO L226 Difference]: Without dead ends: 25992 [2019-12-18 12:59:24,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:59:24,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25992 states. [2019-12-18 12:59:24,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25992 to 22280. [2019-12-18 12:59:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22280 states. [2019-12-18 12:59:24,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22280 states to 22280 states and 68656 transitions. [2019-12-18 12:59:24,437 INFO L78 Accepts]: Start accepts. Automaton has 22280 states and 68656 transitions. Word has length 66 [2019-12-18 12:59:24,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:24,437 INFO L462 AbstractCegarLoop]: Abstraction has 22280 states and 68656 transitions. [2019-12-18 12:59:24,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:59:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 22280 states and 68656 transitions. [2019-12-18 12:59:24,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:59:24,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:24,463 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 12:59:24,464 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:59:24,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:24,464 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 6 times [2019-12-18 12:59:24,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:24,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478678200] [2019-12-18 12:59:24,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:59:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:59:24,597 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:59:24,597 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:59:24,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t678~0.base_22|) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_380 0) (= v_~z$r_buff0_thd2~0_184 0) (= v_~__unbuffered_cnt~0_128 0) (= v_~y~0_48 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$r_buff1_thd0~0_296 0) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t678~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t678~0.base_22|) |v_ULTIMATE.start_main_~#t678~0.offset_16| 0))) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t678~0.base_22| 1) |v_#valid_69|) (= v_~z$w_buff1_used~0_500 0) (= v_~z$r_buff0_thd0~0_197 0) (= 0 |v_#NULL.base_6|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t678~0.base_22| 4)) (= 0 v_~z$flush_delayed~0_43) (= 0 v_~__unbuffered_p0_EAX~0_233) (= (select .cse0 |v_ULTIMATE.start_main_~#t678~0.base_22|) 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff1_thd3~0_396) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_37) (= 0 |v_ULTIMATE.start_main_~#t678~0.offset_16|) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff0_thd3~0_379) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= 0 v_~x~0_133) (= v_~z~0_182 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t678~0.offset=|v_ULTIMATE.start_main_~#t678~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_~#t680~0.offset=|v_ULTIMATE.start_main_~#t680~0.offset_14|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ULTIMATE.start_main_~#t680~0.base=|v_ULTIMATE.start_main_~#t680~0.base_17|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_379, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ~x~0=v_~x~0_133, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t679~0.base=|v_ULTIMATE.start_main_~#t679~0.base_19|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_296, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_184, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ULTIMATE.start_main_~#t679~0.offset=|v_ULTIMATE.start_main_~#t679~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ULTIMATE.start_main_~#t678~0.base=|v_ULTIMATE.start_main_~#t678~0.base_22|, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_380} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t678~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t680~0.offset, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t680~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t679~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t679~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t678~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:59:24,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23) (= v_~x~0_9 v_~__unbuffered_p0_EAX~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:59:24,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (not (= |v_ULTIMATE.start_main_~#t679~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t679~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t679~0.base_11|) |v_ULTIMATE.start_main_~#t679~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t679~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t679~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t679~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t679~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t679~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t679~0.base=|v_ULTIMATE.start_main_~#t679~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t679~0.offset=|v_ULTIMATE.start_main_~#t679~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t679~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t679~0.offset] because there is no mapped edge [2019-12-18 12:59:24,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t680~0.base_12|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t680~0.base_12| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t680~0.base_12| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t680~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t680~0.base_12|) |v_ULTIMATE.start_main_~#t680~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t680~0.base_12|) (= |v_ULTIMATE.start_main_~#t680~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t680~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t680~0.offset=|v_ULTIMATE.start_main_~#t680~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t680~0.base=|v_ULTIMATE.start_main_~#t680~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t680~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t680~0.base] because there is no mapped edge [2019-12-18 12:59:24,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1457778573 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-1457778573 256) 0)) (.cse0 (= |P1Thread1of1ForFork2_#t~ite10_Out-1457778573| |P1Thread1of1ForFork2_#t~ite9_Out-1457778573|))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1457778573| ~z~0_In-1457778573) .cse0 (or .cse1 .cse2)) (and (not .cse2) (not .cse1) .cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-1457778573| ~z$w_buff1~0_In-1457778573)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1457778573, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1457778573, ~z$w_buff1~0=~z$w_buff1~0_In-1457778573, ~z~0=~z~0_In-1457778573} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1457778573|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1457778573, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1457778573|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1457778573, ~z$w_buff1~0=~z$w_buff1~0_In-1457778573, ~z~0=~z~0_In-1457778573} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:59:24,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-932026416 256) 0))) (or (and (= ~z$w_buff1~0_In-932026416 |P2Thread1of1ForFork0_#t~ite23_Out-932026416|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-932026416 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-932026416 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In-932026416 256)) .cse0) (and (= 0 (mod ~z$w_buff1_used~0_In-932026416 256)) .cse0))) .cse1 (= |P2Thread1of1ForFork0_#t~ite23_Out-932026416| |P2Thread1of1ForFork0_#t~ite24_Out-932026416|)) (and (= ~z$w_buff1~0_In-932026416 |P2Thread1of1ForFork0_#t~ite24_Out-932026416|) (= |P2Thread1of1ForFork0_#t~ite23_In-932026416| |P2Thread1of1ForFork0_#t~ite23_Out-932026416|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-932026416, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-932026416, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-932026416|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-932026416, ~z$w_buff1~0=~z$w_buff1~0_In-932026416, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-932026416, ~weak$$choice2~0=~weak$$choice2~0_In-932026416} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-932026416, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-932026416|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-932026416, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-932026416|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-932026416, ~z$w_buff1~0=~z$w_buff1~0_In-932026416, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-932026416, ~weak$$choice2~0=~weak$$choice2~0_In-932026416} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 12:59:24,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse5 (= 0 (mod ~z$r_buff1_thd3~0_In1343491503 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1343491503 256))) (.cse6 (= 0 (mod ~z$r_buff0_thd3~0_In1343491503 256))) (.cse4 (= (mod ~z$w_buff1_used~0_In1343491503 256) 0)) (.cse1 (= |P2Thread1of1ForFork0_#t~ite30_Out1343491503| |P2Thread1of1ForFork0_#t~ite29_Out1343491503|)) (.cse0 (= (mod ~weak$$choice2~0_In1343491503 256) 0))) (or (let ((.cse3 (not .cse6))) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite28_Out1343491503| 0) .cse1 (not .cse2) (or .cse3 (not .cse4)) (= |P2Thread1of1ForFork0_#t~ite28_Out1343491503| |P2Thread1of1ForFork0_#t~ite29_Out1343491503|) (or .cse3 (not .cse5)))) (and (= |P2Thread1of1ForFork0_#t~ite28_In1343491503| |P2Thread1of1ForFork0_#t~ite28_Out1343491503|) (or (and (or (and .cse5 .cse6) .cse2 (and .cse6 .cse4)) .cse0 .cse1 (= |P2Thread1of1ForFork0_#t~ite29_Out1343491503| ~z$w_buff1_used~0_In1343491503)) (and (= |P2Thread1of1ForFork0_#t~ite29_In1343491503| |P2Thread1of1ForFork0_#t~ite29_Out1343491503|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite30_Out1343491503| ~z$w_buff1_used~0_In1343491503)))))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In1343491503|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1343491503, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1343491503, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1343491503, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1343491503, ~weak$$choice2~0=~weak$$choice2~0_In1343491503, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1343491503|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1343491503|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1343491503, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1343491503, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1343491503, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1343491503, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1343491503|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1343491503|, ~weak$$choice2~0=~weak$$choice2~0_In1343491503} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:59:24,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0)) (= v_~z$r_buff0_thd3~0_373 v_~z$r_buff0_thd3~0_372)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_373, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_372, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:59:24,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 12:59:24,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out-1025738865| |P2Thread1of1ForFork0_#t~ite38_Out-1025738865|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1025738865 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1025738865 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In-1025738865 |P2Thread1of1ForFork0_#t~ite38_Out-1025738865|)) (and .cse0 (= ~z$w_buff1~0_In-1025738865 |P2Thread1of1ForFork0_#t~ite38_Out-1025738865|) (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1025738865, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1025738865, ~z$w_buff1~0=~z$w_buff1~0_In-1025738865, ~z~0=~z~0_In-1025738865} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-1025738865|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1025738865|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1025738865, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1025738865, ~z$w_buff1~0=~z$w_buff1~0_In-1025738865, ~z~0=~z~0_In-1025738865} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:59:24,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In647069897 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In647069897 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out647069897| ~z$w_buff0_used~0_In647069897)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out647069897|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In647069897, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In647069897} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In647069897, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out647069897|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In647069897} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:59:24,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In-232602318 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-232602318 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-232602318 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-232602318 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-232602318| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-232602318| ~z$w_buff1_used~0_In-232602318) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-232602318, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-232602318, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-232602318, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-232602318} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-232602318, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-232602318, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-232602318, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-232602318, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-232602318|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:59:24,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-248090986 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-248090986 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-248090986| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-248090986| ~z$r_buff0_thd3~0_In-248090986)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-248090986, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-248090986} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-248090986, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-248090986, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-248090986|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:59:24,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-2136320397 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-2136320397 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-2136320397 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2136320397 256)))) (or (and (= ~z$r_buff1_thd3~0_In-2136320397 |P2Thread1of1ForFork0_#t~ite43_Out-2136320397|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-2136320397|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2136320397, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2136320397, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2136320397, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2136320397} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-2136320397|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2136320397, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2136320397, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2136320397, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2136320397} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:59:24,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= v_~z$r_buff1_thd3~0_306 |v_P2Thread1of1ForFork0_#t~ite43_56|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:59:24,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1686763622 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1686763622 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out-1686763622| ~z$w_buff0_used~0_In-1686763622) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-1686763622| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1686763622, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1686763622} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1686763622|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1686763622, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1686763622} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:59:24,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1633485992 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In1633485992 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1633485992 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In1633485992 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out1633485992| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1633485992 |P0Thread1of1ForFork1_#t~ite6_Out1633485992|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1633485992, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1633485992, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1633485992, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1633485992} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1633485992, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1633485992|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1633485992, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1633485992, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1633485992} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:59:24,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In476024616 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In476024616 256) 0))) (or (and (= ~z$r_buff0_thd1~0_In476024616 ~z$r_buff0_thd1~0_Out476024616) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out476024616)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In476024616, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In476024616} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In476024616, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out476024616|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out476024616} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:59:24,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1018574144 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-1018574144 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1018574144 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1018574144 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In-1018574144 |P0Thread1of1ForFork1_#t~ite8_Out-1018574144|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1018574144|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1018574144, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1018574144, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1018574144, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1018574144} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1018574144|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1018574144, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1018574144, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1018574144, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1018574144} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:59:24,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:59:24,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In2004956924 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In2004956924 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out2004956924| ~z$w_buff0_used~0_In2004956924) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out2004956924| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2004956924, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2004956924} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2004956924, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out2004956924|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2004956924} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:59:24,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd2~0_In-625162343 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-625162343 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-625162343 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-625162343 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-625162343 |P1Thread1of1ForFork2_#t~ite12_Out-625162343|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork2_#t~ite12_Out-625162343| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-625162343, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-625162343, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-625162343, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-625162343} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-625162343, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-625162343, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-625162343, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-625162343|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-625162343} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:59:24,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-56705953 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-56705953 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out-56705953| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In-56705953 |P1Thread1of1ForFork2_#t~ite13_Out-56705953|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-56705953, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-56705953} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-56705953, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-56705953|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-56705953} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:59:24,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1110952591 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1110952591 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-1110952591 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1110952591 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1110952591| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite14_Out-1110952591| ~z$r_buff1_thd2~0_In-1110952591)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1110952591, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1110952591, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1110952591, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1110952591} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1110952591, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1110952591, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1110952591, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1110952591|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1110952591} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:59:24,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_186, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:59:24,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:59:24,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-884642580 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-884642580 256) 0))) (or (and (= ~z$w_buff1~0_In-884642580 |ULTIMATE.start_main_#t~ite47_Out-884642580|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In-884642580 |ULTIMATE.start_main_#t~ite47_Out-884642580|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-884642580, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-884642580, ~z$w_buff1~0=~z$w_buff1~0_In-884642580, ~z~0=~z~0_In-884642580} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-884642580, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-884642580|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-884642580, ~z$w_buff1~0=~z$w_buff1~0_In-884642580, ~z~0=~z~0_In-884642580} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:59:24,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-18 12:59:24,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In644286153 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In644286153 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out644286153| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In644286153 |ULTIMATE.start_main_#t~ite49_Out644286153|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In644286153, ~z$w_buff0_used~0=~z$w_buff0_used~0_In644286153} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In644286153, ~z$w_buff0_used~0=~z$w_buff0_used~0_In644286153, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out644286153|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:59:24,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In603514128 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In603514128 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In603514128 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In603514128 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out603514128| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out603514128| ~z$w_buff1_used~0_In603514128) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In603514128, ~z$w_buff0_used~0=~z$w_buff0_used~0_In603514128, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In603514128, ~z$w_buff1_used~0=~z$w_buff1_used~0_In603514128} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out603514128|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In603514128, ~z$w_buff0_used~0=~z$w_buff0_used~0_In603514128, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In603514128, ~z$w_buff1_used~0=~z$w_buff1_used~0_In603514128} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:59:24,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1061289322 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1061289322 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-1061289322| ~z$r_buff0_thd0~0_In-1061289322) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1061289322| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1061289322, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1061289322} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1061289322, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1061289322|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1061289322} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:59:24,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1792766493 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1792766493 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1792766493 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1792766493 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-1792766493|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite52_Out-1792766493| ~z$r_buff1_thd0~0_In-1792766493) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1792766493, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1792766493, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1792766493, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1792766493} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1792766493|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1792766493, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1792766493, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1792766493, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1792766493} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:59:24,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_25 2) (= 2 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~z$r_buff1_thd0~0_219 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 0 v_~__unbuffered_p0_EAX~0_178)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_219, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:59:24,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:59:24 BasicIcfg [2019-12-18 12:59:24,711 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:59:24,712 INFO L168 Benchmark]: Toolchain (without parser) took 137820.99 ms. Allocated memory was 144.7 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 12:59:24,713 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 144.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 12:59:24,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 883.60 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 99.6 MB in the beginning and 154.6 MB in the end (delta: -55.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-18 12:59:24,714 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.40 ms. Allocated memory is still 202.4 MB. Free memory was 154.6 MB in the beginning and 151.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 12:59:24,714 INFO L168 Benchmark]: Boogie Preprocessor took 40.67 ms. Allocated memory is still 202.4 MB. Free memory was 151.9 MB in the beginning and 149.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:59:24,714 INFO L168 Benchmark]: RCFGBuilder took 844.65 ms. Allocated memory is still 202.4 MB. Free memory was 149.2 MB in the beginning and 99.3 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:59:24,715 INFO L168 Benchmark]: TraceAbstraction took 135970.12 ms. Allocated memory was 202.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 98.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 12:59:24,717 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.21 ms. Allocated memory is still 144.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 883.60 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 99.6 MB in the beginning and 154.6 MB in the end (delta: -55.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.40 ms. Allocated memory is still 202.4 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.67 ms. Allocated memory is still 202.4 MB. Free memory was 151.9 MB in the beginning and 149.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 844.65 ms. Allocated memory is still 202.4 MB. Free memory was 149.2 MB in the beginning and 99.3 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 135970.12 ms. Allocated memory was 202.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 98.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7047 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t678, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t679, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t680, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=7, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 135.6s, OverallIterations: 42, TraceHistogramMax: 1, AutomataDifference: 49.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11217 SDtfs, 13873 SDslu, 35912 SDs, 0 SdLazy, 23330 SolverSat, 649 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 614 GetRequests, 125 SyntacticMatches, 44 SemanticMatches, 445 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1567 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred 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: 52.7s AutomataMinimizationTime, 41 MinimizatonAttempts, 485875 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2042 NumberOfCodeBlocks, 2042 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1935 ConstructedInterpolants, 0 QuantifiedInterpolants, 480723 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 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...