/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:34:08,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:34:08,713 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:34:08,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:34:08,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:34:08,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:34:08,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:34:08,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:34:08,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:34:08,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:34:08,732 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:34:08,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:34:08,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:34:08,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:34:08,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:34:08,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:34:08,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:34:08,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:34:08,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:34:08,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:34:08,747 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:34:08,748 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:34:08,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:34:08,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:34:08,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:34:08,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:34:08,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:34:08,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:34:08,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:34:08,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:34:08,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:34:08,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:34:08,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:34:08,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:34:08,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:34:08,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:34:08,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:34:08,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:34:08,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:34:08,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:34:08,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:34:08,772 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:34:08,796 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:34:08,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:34:08,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:34:08,797 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:34:08,798 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:34:08,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:34:08,798 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:34:08,798 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:34:08,798 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:34:08,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:34:08,799 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:34:08,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:34:08,799 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:34:08,799 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:34:08,800 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:34:08,800 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:34:08,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:34:08,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:34:08,800 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:34:08,801 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:34:08,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:34:08,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:34:08,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:34:08,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:34:08,802 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:34:08,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:34:08,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:34:08,802 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:34:08,802 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:34:08,802 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:34:09,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:34:09,073 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:34:09,077 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:34:09,078 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:34:09,079 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:34:09,080 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_power.oepc.i [2019-12-18 20:34:09,153 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a88c5c34/1fb380f8464d4329b41807448731d0d1/FLAGba2fe3a8b [2019-12-18 20:34:09,683 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:34:09,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_power.oepc.i [2019-12-18 20:34:09,701 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a88c5c34/1fb380f8464d4329b41807448731d0d1/FLAGba2fe3a8b [2019-12-18 20:34:09,964 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a88c5c34/1fb380f8464d4329b41807448731d0d1 [2019-12-18 20:34:09,973 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:34:09,975 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:34:09,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:34:09,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:34:09,980 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:34:09,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:34:09" (1/1) ... [2019-12-18 20:34:09,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da7a078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:34:09, skipping insertion in model container [2019-12-18 20:34:09,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:34:09" (1/1) ... [2019-12-18 20:34:09,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:34:10,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:34:10,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:34:10,616 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:34:10,692 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:34:10,770 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:34:10,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:34:10 WrapperNode [2019-12-18 20:34:10,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:34:10,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:34:10,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:34:10,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:34:10,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:34:10" (1/1) ... [2019-12-18 20:34:10,811 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:34:10" (1/1) ... [2019-12-18 20:34:10,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:34:10,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:34:10,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:34:10,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:34:10,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:34:10" (1/1) ... [2019-12-18 20:34:10,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:34:10" (1/1) ... [2019-12-18 20:34:10,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:34:10" (1/1) ... [2019-12-18 20:34:10,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:34:10" (1/1) ... [2019-12-18 20:34:10,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:34:10" (1/1) ... [2019-12-18 20:34:10,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:34:10" (1/1) ... [2019-12-18 20:34:10,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:34:10" (1/1) ... [2019-12-18 20:34:10,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:34:10,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:34:10,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:34:10,879 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:34:10,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:34:10" (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 20:34:10,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:34:10,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:34:10,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:34:10,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:34:10,951 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:34:10,951 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:34:10,951 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:34:10,951 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:34:10,951 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:34:10,951 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:34:10,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:34:10,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:34:10,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:34:10,953 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 20:34:11,744 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:34:11,744 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:34:11,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:34:11 BoogieIcfgContainer [2019-12-18 20:34:11,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:34:11,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:34:11,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:34:11,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:34:11,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:34:09" (1/3) ... [2019-12-18 20:34:11,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4877e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:34:11, skipping insertion in model container [2019-12-18 20:34:11,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:34:10" (2/3) ... [2019-12-18 20:34:11,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4877e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:34:11, skipping insertion in model container [2019-12-18 20:34:11,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:34:11" (3/3) ... [2019-12-18 20:34:11,754 INFO L109 eAbstractionObserver]: Analyzing ICFG mix019_power.oepc.i [2019-12-18 20:34:11,763 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:34:11,763 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:34:11,771 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:34:11,772 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:34:11,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,814 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,814 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,815 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,815 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,816 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,824 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,824 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,833 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,833 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,881 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,883 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,891 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,891 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,892 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,894 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:34:11,910 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:34:11,932 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:34:11,933 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:34:11,933 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:34:11,933 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:34:11,933 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:34:11,933 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:34:11,933 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:34:11,933 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:34:11,955 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 20:34:11,958 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 20:34:12,060 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 20:34:12,060 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:34:12,081 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 20:34:12,111 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 20:34:12,158 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 20:34:12,159 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:34:12,170 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 20:34:12,196 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 20:34:12,197 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:34:15,785 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 20:34:15,932 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 20:34:15,956 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84223 [2019-12-18 20:34:15,956 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 20:34:15,960 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-18 20:34:35,292 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122130 states. [2019-12-18 20:34:35,294 INFO L276 IsEmpty]: Start isEmpty. Operand 122130 states. [2019-12-18 20:34:35,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 20:34:35,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:34:35,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 20:34:35,301 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 20:34:35,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:34:35,307 INFO L82 PathProgramCache]: Analyzing trace with hash 912016, now seen corresponding path program 1 times [2019-12-18 20:34:35,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:34:35,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355980959] [2019-12-18 20:34:35,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:34:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:34:35,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 20:34:35,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355980959] [2019-12-18 20:34:35,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:34:35,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:34:35,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929029076] [2019-12-18 20:34:35,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:34:35,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:34:35,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:34:35,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:34:35,579 INFO L87 Difference]: Start difference. First operand 122130 states. Second operand 3 states. [2019-12-18 20:34:39,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:34:39,001 INFO L93 Difference]: Finished difference Result 120482 states and 514480 transitions. [2019-12-18 20:34:39,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:34:39,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 20:34:39,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:34:39,674 INFO L225 Difference]: With dead ends: 120482 [2019-12-18 20:34:39,674 INFO L226 Difference]: Without dead ends: 113384 [2019-12-18 20:34:39,676 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 20:34:46,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113384 states. [2019-12-18 20:34:48,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113384 to 113384. [2019-12-18 20:34:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113384 states. [2019-12-18 20:34:52,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113384 states to 113384 states and 483579 transitions. [2019-12-18 20:34:52,744 INFO L78 Accepts]: Start accepts. Automaton has 113384 states and 483579 transitions. Word has length 3 [2019-12-18 20:34:52,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:34:52,745 INFO L462 AbstractCegarLoop]: Abstraction has 113384 states and 483579 transitions. [2019-12-18 20:34:52,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:34:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand 113384 states and 483579 transitions. [2019-12-18 20:34:52,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:34:52,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:34:52,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:34:52,750 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 20:34:52,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:34:52,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1106167815, now seen corresponding path program 1 times [2019-12-18 20:34:52,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:34:52,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975582880] [2019-12-18 20:34:52,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:34:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:34:52,867 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 20:34:52,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975582880] [2019-12-18 20:34:52,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:34:52,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:34:52,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605452462] [2019-12-18 20:34:52,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:34:52,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:34:52,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:34:52,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:34:52,870 INFO L87 Difference]: Start difference. First operand 113384 states and 483579 transitions. Second operand 4 states. [2019-12-18 20:34:58,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:34:58,437 INFO L93 Difference]: Finished difference Result 179498 states and 731972 transitions. [2019-12-18 20:34:58,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:34:58,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 20:34:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:34:59,146 INFO L225 Difference]: With dead ends: 179498 [2019-12-18 20:34:59,146 INFO L226 Difference]: Without dead ends: 179449 [2019-12-18 20:34:59,147 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 20:35:04,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179449 states. [2019-12-18 20:35:09,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179449 to 162546. [2019-12-18 20:35:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162546 states. [2019-12-18 20:35:09,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162546 states to 162546 states and 672884 transitions. [2019-12-18 20:35:09,628 INFO L78 Accepts]: Start accepts. Automaton has 162546 states and 672884 transitions. Word has length 11 [2019-12-18 20:35:09,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:09,629 INFO L462 AbstractCegarLoop]: Abstraction has 162546 states and 672884 transitions. [2019-12-18 20:35:09,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:35:09,629 INFO L276 IsEmpty]: Start isEmpty. Operand 162546 states and 672884 transitions. [2019-12-18 20:35:09,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:35:09,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:09,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:35:09,637 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 20:35:09,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:09,641 INFO L82 PathProgramCache]: Analyzing trace with hash 490332773, now seen corresponding path program 1 times [2019-12-18 20:35:09,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:09,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199946155] [2019-12-18 20:35:09,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:09,705 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 20:35:09,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199946155] [2019-12-18 20:35:09,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:09,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:35:09,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101129002] [2019-12-18 20:35:09,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:35:09,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:09,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:35:09,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:35:09,707 INFO L87 Difference]: Start difference. First operand 162546 states and 672884 transitions. Second operand 3 states. [2019-12-18 20:35:09,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:09,851 INFO L93 Difference]: Finished difference Result 34413 states and 111772 transitions. [2019-12-18 20:35:09,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:35:09,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 20:35:09,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:09,911 INFO L225 Difference]: With dead ends: 34413 [2019-12-18 20:35:09,911 INFO L226 Difference]: Without dead ends: 34413 [2019-12-18 20:35:09,912 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 20:35:10,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34413 states. [2019-12-18 20:35:15,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34413 to 34413. [2019-12-18 20:35:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34413 states. [2019-12-18 20:35:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34413 states to 34413 states and 111772 transitions. [2019-12-18 20:35:15,370 INFO L78 Accepts]: Start accepts. Automaton has 34413 states and 111772 transitions. Word has length 13 [2019-12-18 20:35:15,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:15,370 INFO L462 AbstractCegarLoop]: Abstraction has 34413 states and 111772 transitions. [2019-12-18 20:35:15,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:35:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand 34413 states and 111772 transitions. [2019-12-18 20:35:15,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:35:15,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:15,374 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:35:15,374 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 20:35:15,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:15,375 INFO L82 PathProgramCache]: Analyzing trace with hash 562012763, now seen corresponding path program 1 times [2019-12-18 20:35:15,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:15,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115030806] [2019-12-18 20:35:15,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:15,442 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 20:35:15,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115030806] [2019-12-18 20:35:15,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:15,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:35:15,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428091064] [2019-12-18 20:35:15,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:35:15,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:15,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:35:15,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:35:15,444 INFO L87 Difference]: Start difference. First operand 34413 states and 111772 transitions. Second operand 3 states. [2019-12-18 20:35:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:15,677 INFO L93 Difference]: Finished difference Result 54627 states and 176362 transitions. [2019-12-18 20:35:15,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:35:15,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 20:35:15,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:15,771 INFO L225 Difference]: With dead ends: 54627 [2019-12-18 20:35:15,771 INFO L226 Difference]: Without dead ends: 54627 [2019-12-18 20:35:15,771 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 20:35:15,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54627 states. [2019-12-18 20:35:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54627 to 41131. [2019-12-18 20:35:16,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41131 states. [2019-12-18 20:35:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41131 states to 41131 states and 134258 transitions. [2019-12-18 20:35:16,599 INFO L78 Accepts]: Start accepts. Automaton has 41131 states and 134258 transitions. Word has length 16 [2019-12-18 20:35:16,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:16,600 INFO L462 AbstractCegarLoop]: Abstraction has 41131 states and 134258 transitions. [2019-12-18 20:35:16,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:35:16,600 INFO L276 IsEmpty]: Start isEmpty. Operand 41131 states and 134258 transitions. [2019-12-18 20:35:16,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:35:16,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:16,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:35:16,604 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 20:35:16,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:16,604 INFO L82 PathProgramCache]: Analyzing trace with hash 562138282, now seen corresponding path program 1 times [2019-12-18 20:35:16,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:16,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587027184] [2019-12-18 20:35:16,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:16,689 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 20:35:16,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587027184] [2019-12-18 20:35:16,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:16,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:35:16,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107828421] [2019-12-18 20:35:16,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:35:16,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:16,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:35:16,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:35:16,691 INFO L87 Difference]: Start difference. First operand 41131 states and 134258 transitions. Second operand 4 states. [2019-12-18 20:35:17,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:17,459 INFO L93 Difference]: Finished difference Result 48927 states and 157520 transitions. [2019-12-18 20:35:17,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:35:17,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:35:17,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:17,538 INFO L225 Difference]: With dead ends: 48927 [2019-12-18 20:35:17,538 INFO L226 Difference]: Without dead ends: 48927 [2019-12-18 20:35:17,539 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 20:35:17,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48927 states. [2019-12-18 20:35:18,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48927 to 44953. [2019-12-18 20:35:18,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44953 states. [2019-12-18 20:35:18,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44953 states to 44953 states and 145741 transitions. [2019-12-18 20:35:18,371 INFO L78 Accepts]: Start accepts. Automaton has 44953 states and 145741 transitions. Word has length 16 [2019-12-18 20:35:18,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:18,372 INFO L462 AbstractCegarLoop]: Abstraction has 44953 states and 145741 transitions. [2019-12-18 20:35:18,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:35:18,372 INFO L276 IsEmpty]: Start isEmpty. Operand 44953 states and 145741 transitions. [2019-12-18 20:35:18,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:35:18,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:18,376 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:35:18,376 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 20:35:18,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:18,377 INFO L82 PathProgramCache]: Analyzing trace with hash 173692215, now seen corresponding path program 1 times [2019-12-18 20:35:18,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:18,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035474305] [2019-12-18 20:35:18,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:18,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 20:35:18,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035474305] [2019-12-18 20:35:18,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:18,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:35:18,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738056285] [2019-12-18 20:35:18,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:35:18,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:18,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:35:18,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:35:18,454 INFO L87 Difference]: Start difference. First operand 44953 states and 145741 transitions. Second operand 4 states. [2019-12-18 20:35:18,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:18,847 INFO L93 Difference]: Finished difference Result 53251 states and 171579 transitions. [2019-12-18 20:35:18,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:35:18,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:35:18,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:18,937 INFO L225 Difference]: With dead ends: 53251 [2019-12-18 20:35:18,937 INFO L226 Difference]: Without dead ends: 53251 [2019-12-18 20:35:18,938 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 20:35:19,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53251 states. [2019-12-18 20:35:20,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53251 to 46409. [2019-12-18 20:35:20,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46409 states. [2019-12-18 20:35:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46409 states to 46409 states and 150674 transitions. [2019-12-18 20:35:20,265 INFO L78 Accepts]: Start accepts. Automaton has 46409 states and 150674 transitions. Word has length 16 [2019-12-18 20:35:20,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:20,266 INFO L462 AbstractCegarLoop]: Abstraction has 46409 states and 150674 transitions. [2019-12-18 20:35:20,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:35:20,266 INFO L276 IsEmpty]: Start isEmpty. Operand 46409 states and 150674 transitions. [2019-12-18 20:35:20,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:35:20,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:20,275 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 20:35:20,276 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 20:35:20,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:20,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1710143018, now seen corresponding path program 1 times [2019-12-18 20:35:20,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:20,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421294811] [2019-12-18 20:35:20,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:20,384 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 20:35:20,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421294811] [2019-12-18 20:35:20,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:20,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:35:20,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514239178] [2019-12-18 20:35:20,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:35:20,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:20,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:35:20,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:35:20,388 INFO L87 Difference]: Start difference. First operand 46409 states and 150674 transitions. Second operand 5 states. [2019-12-18 20:35:21,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:21,104 INFO L93 Difference]: Finished difference Result 63192 states and 200300 transitions. [2019-12-18 20:35:21,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:35:21,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:35:21,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:21,213 INFO L225 Difference]: With dead ends: 63192 [2019-12-18 20:35:21,213 INFO L226 Difference]: Without dead ends: 63185 [2019-12-18 20:35:21,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 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 20:35:21,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63185 states. [2019-12-18 20:35:22,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63185 to 47511. [2019-12-18 20:35:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47511 states. [2019-12-18 20:35:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47511 states to 47511 states and 154018 transitions. [2019-12-18 20:35:22,707 INFO L78 Accepts]: Start accepts. Automaton has 47511 states and 154018 transitions. Word has length 22 [2019-12-18 20:35:22,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:22,707 INFO L462 AbstractCegarLoop]: Abstraction has 47511 states and 154018 transitions. [2019-12-18 20:35:22,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:35:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 47511 states and 154018 transitions. [2019-12-18 20:35:22,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:35:22,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:22,717 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 20:35:22,718 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 20:35:22,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:22,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2075627383, now seen corresponding path program 1 times [2019-12-18 20:35:22,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:22,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011685269] [2019-12-18 20:35:22,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:35:22,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011685269] [2019-12-18 20:35:22,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:22,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:35:22,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543663534] [2019-12-18 20:35:22,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:35:22,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:22,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:35:22,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:35:22,819 INFO L87 Difference]: Start difference. First operand 47511 states and 154018 transitions. Second operand 5 states. [2019-12-18 20:35:23,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:23,543 INFO L93 Difference]: Finished difference Result 65538 states and 207239 transitions. [2019-12-18 20:35:23,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:35:23,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:35:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:23,649 INFO L225 Difference]: With dead ends: 65538 [2019-12-18 20:35:23,650 INFO L226 Difference]: Without dead ends: 65531 [2019-12-18 20:35:23,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 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 20:35:23,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65531 states. [2019-12-18 20:35:24,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65531 to 45771. [2019-12-18 20:35:24,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45771 states. [2019-12-18 20:35:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45771 states to 45771 states and 148366 transitions. [2019-12-18 20:35:24,558 INFO L78 Accepts]: Start accepts. Automaton has 45771 states and 148366 transitions. Word has length 22 [2019-12-18 20:35:24,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:24,558 INFO L462 AbstractCegarLoop]: Abstraction has 45771 states and 148366 transitions. [2019-12-18 20:35:24,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:35:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 45771 states and 148366 transitions. [2019-12-18 20:35:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:35:24,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:24,570 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 20:35:24,570 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 20:35:24,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:24,571 INFO L82 PathProgramCache]: Analyzing trace with hash -433341706, now seen corresponding path program 1 times [2019-12-18 20:35:24,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:24,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720804152] [2019-12-18 20:35:24,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:24,621 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 20:35:24,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720804152] [2019-12-18 20:35:24,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:24,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:35:24,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342897192] [2019-12-18 20:35:24,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:35:24,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:24,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:35:24,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:35:24,623 INFO L87 Difference]: Start difference. First operand 45771 states and 148366 transitions. Second operand 4 states. [2019-12-18 20:35:25,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:25,043 INFO L93 Difference]: Finished difference Result 17755 states and 54382 transitions. [2019-12-18 20:35:25,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:35:25,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 20:35:25,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:25,080 INFO L225 Difference]: With dead ends: 17755 [2019-12-18 20:35:25,081 INFO L226 Difference]: Without dead ends: 17755 [2019-12-18 20:35:25,081 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 20:35:25,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17755 states. [2019-12-18 20:35:25,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17755 to 17427. [2019-12-18 20:35:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17427 states. [2019-12-18 20:35:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17427 states to 17427 states and 53446 transitions. [2019-12-18 20:35:25,401 INFO L78 Accepts]: Start accepts. Automaton has 17427 states and 53446 transitions. Word has length 25 [2019-12-18 20:35:25,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:25,401 INFO L462 AbstractCegarLoop]: Abstraction has 17427 states and 53446 transitions. [2019-12-18 20:35:25,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:35:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 17427 states and 53446 transitions. [2019-12-18 20:35:25,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:35:25,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:25,415 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:35:25,415 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 20:35:25,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:25,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2045967469, now seen corresponding path program 1 times [2019-12-18 20:35:25,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:25,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473717] [2019-12-18 20:35:25,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:25,535 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 20:35:25,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473717] [2019-12-18 20:35:25,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:25,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:35:25,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424484420] [2019-12-18 20:35:25,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:35:25,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:25,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:35:25,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:35:25,537 INFO L87 Difference]: Start difference. First operand 17427 states and 53446 transitions. Second operand 5 states. [2019-12-18 20:35:25,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:25,920 INFO L93 Difference]: Finished difference Result 22078 states and 66584 transitions. [2019-12-18 20:35:25,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:35:25,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 20:35:25,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:25,950 INFO L225 Difference]: With dead ends: 22078 [2019-12-18 20:35:25,950 INFO L226 Difference]: Without dead ends: 22078 [2019-12-18 20:35:25,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 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 20:35:26,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22078 states. [2019-12-18 20:35:26,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22078 to 20690. [2019-12-18 20:35:26,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20690 states. [2019-12-18 20:35:26,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20690 states to 20690 states and 63094 transitions. [2019-12-18 20:35:26,250 INFO L78 Accepts]: Start accepts. Automaton has 20690 states and 63094 transitions. Word has length 27 [2019-12-18 20:35:26,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:26,250 INFO L462 AbstractCegarLoop]: Abstraction has 20690 states and 63094 transitions. [2019-12-18 20:35:26,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:35:26,251 INFO L276 IsEmpty]: Start isEmpty. Operand 20690 states and 63094 transitions. [2019-12-18 20:35:26,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:35:26,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:26,265 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 20:35:26,265 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 20:35:26,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:26,265 INFO L82 PathProgramCache]: Analyzing trace with hash -23775369, now seen corresponding path program 1 times [2019-12-18 20:35:26,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:26,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212839279] [2019-12-18 20:35:26,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:35:26,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212839279] [2019-12-18 20:35:26,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:26,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:35:26,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057897607] [2019-12-18 20:35:26,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:35:26,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:26,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:35:26,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:35:26,347 INFO L87 Difference]: Start difference. First operand 20690 states and 63094 transitions. Second operand 5 states. [2019-12-18 20:35:26,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:26,473 INFO L93 Difference]: Finished difference Result 21192 states and 64429 transitions. [2019-12-18 20:35:26,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:35:26,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 20:35:26,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:26,512 INFO L225 Difference]: With dead ends: 21192 [2019-12-18 20:35:26,513 INFO L226 Difference]: Without dead ends: 21192 [2019-12-18 20:35:26,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:35:26,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21192 states. [2019-12-18 20:35:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21192 to 21192. [2019-12-18 20:35:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21192 states. [2019-12-18 20:35:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21192 states to 21192 states and 64429 transitions. [2019-12-18 20:35:26,820 INFO L78 Accepts]: Start accepts. Automaton has 21192 states and 64429 transitions. Word has length 28 [2019-12-18 20:35:26,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:26,821 INFO L462 AbstractCegarLoop]: Abstraction has 21192 states and 64429 transitions. [2019-12-18 20:35:26,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:35:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand 21192 states and 64429 transitions. [2019-12-18 20:35:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 20:35:26,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:26,837 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] [2019-12-18 20:35:26,837 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 20:35:26,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:26,838 INFO L82 PathProgramCache]: Analyzing trace with hash -994503224, now seen corresponding path program 1 times [2019-12-18 20:35:26,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:26,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449885093] [2019-12-18 20:35:26,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:26,925 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 20:35:26,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449885093] [2019-12-18 20:35:26,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:26,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:35:26,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910963422] [2019-12-18 20:35:26,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:35:26,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:26,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:35:26,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:35:26,928 INFO L87 Difference]: Start difference. First operand 21192 states and 64429 transitions. Second operand 5 states. [2019-12-18 20:35:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:27,285 INFO L93 Difference]: Finished difference Result 24492 states and 73342 transitions. [2019-12-18 20:35:27,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:35:27,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 20:35:27,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:27,319 INFO L225 Difference]: With dead ends: 24492 [2019-12-18 20:35:27,319 INFO L226 Difference]: Without dead ends: 24492 [2019-12-18 20:35:27,319 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 20:35:27,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24492 states. [2019-12-18 20:35:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24492 to 20516. [2019-12-18 20:35:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20516 states. [2019-12-18 20:35:27,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20516 states to 20516 states and 62500 transitions. [2019-12-18 20:35:27,891 INFO L78 Accepts]: Start accepts. Automaton has 20516 states and 62500 transitions. Word has length 29 [2019-12-18 20:35:27,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:27,892 INFO L462 AbstractCegarLoop]: Abstraction has 20516 states and 62500 transitions. [2019-12-18 20:35:27,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:35:27,892 INFO L276 IsEmpty]: Start isEmpty. Operand 20516 states and 62500 transitions. [2019-12-18 20:35:27,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:35:27,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:27,913 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:35:27,913 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 20:35:27,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:27,914 INFO L82 PathProgramCache]: Analyzing trace with hash 454456511, now seen corresponding path program 1 times [2019-12-18 20:35:27,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:27,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718425199] [2019-12-18 20:35:27,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:28,035 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 20:35:28,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718425199] [2019-12-18 20:35:28,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:28,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:35:28,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788273839] [2019-12-18 20:35:28,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:35:28,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:28,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:35:28,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:35:28,037 INFO L87 Difference]: Start difference. First operand 20516 states and 62500 transitions. Second operand 6 states. [2019-12-18 20:35:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:28,780 INFO L93 Difference]: Finished difference Result 27891 states and 82809 transitions. [2019-12-18 20:35:28,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:35:28,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 20:35:28,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:28,818 INFO L225 Difference]: With dead ends: 27891 [2019-12-18 20:35:28,818 INFO L226 Difference]: Without dead ends: 27891 [2019-12-18 20:35:28,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:35:28,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27891 states. [2019-12-18 20:35:29,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27891 to 21560. [2019-12-18 20:35:29,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21560 states. [2019-12-18 20:35:29,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21560 states to 21560 states and 65334 transitions. [2019-12-18 20:35:29,163 INFO L78 Accepts]: Start accepts. Automaton has 21560 states and 65334 transitions. Word has length 33 [2019-12-18 20:35:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:29,163 INFO L462 AbstractCegarLoop]: Abstraction has 21560 states and 65334 transitions. [2019-12-18 20:35:29,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:35:29,163 INFO L276 IsEmpty]: Start isEmpty. Operand 21560 states and 65334 transitions. [2019-12-18 20:35:29,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 20:35:29,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:29,182 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] [2019-12-18 20:35:29,182 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 20:35:29,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:29,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1086926900, now seen corresponding path program 1 times [2019-12-18 20:35:29,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:29,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941113502] [2019-12-18 20:35:29,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:29,275 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 20:35:29,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941113502] [2019-12-18 20:35:29,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:29,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:35:29,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58851930] [2019-12-18 20:35:29,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:35:29,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:29,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:35:29,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:35:29,277 INFO L87 Difference]: Start difference. First operand 21560 states and 65334 transitions. Second operand 6 states. [2019-12-18 20:35:30,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:30,017 INFO L93 Difference]: Finished difference Result 27170 states and 81035 transitions. [2019-12-18 20:35:30,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:35:30,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-18 20:35:30,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:30,056 INFO L225 Difference]: With dead ends: 27170 [2019-12-18 20:35:30,056 INFO L226 Difference]: Without dead ends: 27170 [2019-12-18 20:35:30,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:35:30,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27170 states. [2019-12-18 20:35:30,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27170 to 18453. [2019-12-18 20:35:30,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18453 states. [2019-12-18 20:35:30,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18453 states to 18453 states and 56474 transitions. [2019-12-18 20:35:30,393 INFO L78 Accepts]: Start accepts. Automaton has 18453 states and 56474 transitions. Word has length 35 [2019-12-18 20:35:30,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:30,393 INFO L462 AbstractCegarLoop]: Abstraction has 18453 states and 56474 transitions. [2019-12-18 20:35:30,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:35:30,393 INFO L276 IsEmpty]: Start isEmpty. Operand 18453 states and 56474 transitions. [2019-12-18 20:35:30,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:35:30,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:30,412 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 20:35:30,412 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 20:35:30,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:30,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1485923537, now seen corresponding path program 1 times [2019-12-18 20:35:30,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:30,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415594200] [2019-12-18 20:35:30,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:30,470 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 20:35:30,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415594200] [2019-12-18 20:35:30,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:30,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:35:30,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404978795] [2019-12-18 20:35:30,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:35:30,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:30,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:35:30,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:35:30,472 INFO L87 Difference]: Start difference. First operand 18453 states and 56474 transitions. Second operand 3 states. [2019-12-18 20:35:30,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:30,552 INFO L93 Difference]: Finished difference Result 18452 states and 56472 transitions. [2019-12-18 20:35:30,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:35:30,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 20:35:30,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:30,585 INFO L225 Difference]: With dead ends: 18452 [2019-12-18 20:35:30,586 INFO L226 Difference]: Without dead ends: 18452 [2019-12-18 20:35:30,586 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 20:35:30,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18452 states. [2019-12-18 20:35:30,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18452 to 18452. [2019-12-18 20:35:30,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18452 states. [2019-12-18 20:35:30,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18452 states to 18452 states and 56472 transitions. [2019-12-18 20:35:30,868 INFO L78 Accepts]: Start accepts. Automaton has 18452 states and 56472 transitions. Word has length 39 [2019-12-18 20:35:30,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:30,868 INFO L462 AbstractCegarLoop]: Abstraction has 18452 states and 56472 transitions. [2019-12-18 20:35:30,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:35:30,868 INFO L276 IsEmpty]: Start isEmpty. Operand 18452 states and 56472 transitions. [2019-12-18 20:35:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:35:30,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:30,889 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 20:35:30,890 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 20:35:30,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:30,890 INFO L82 PathProgramCache]: Analyzing trace with hash 594517850, now seen corresponding path program 1 times [2019-12-18 20:35:30,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:30,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375292538] [2019-12-18 20:35:30,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:30,959 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 20:35:30,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375292538] [2019-12-18 20:35:30,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:30,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:35:30,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349521244] [2019-12-18 20:35:30,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:35:30,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:30,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:35:30,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:35:30,962 INFO L87 Difference]: Start difference. First operand 18452 states and 56472 transitions. Second operand 5 states. [2019-12-18 20:35:31,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:31,809 INFO L93 Difference]: Finished difference Result 26475 states and 80116 transitions. [2019-12-18 20:35:31,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:35:31,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 20:35:31,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:31,853 INFO L225 Difference]: With dead ends: 26475 [2019-12-18 20:35:31,853 INFO L226 Difference]: Without dead ends: 26475 [2019-12-18 20:35:31,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:35:31,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26475 states. [2019-12-18 20:35:32,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26475 to 24653. [2019-12-18 20:35:32,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24653 states. [2019-12-18 20:35:32,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24653 states to 24653 states and 75114 transitions. [2019-12-18 20:35:32,250 INFO L78 Accepts]: Start accepts. Automaton has 24653 states and 75114 transitions. Word has length 40 [2019-12-18 20:35:32,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:32,250 INFO L462 AbstractCegarLoop]: Abstraction has 24653 states and 75114 transitions. [2019-12-18 20:35:32,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:35:32,250 INFO L276 IsEmpty]: Start isEmpty. Operand 24653 states and 75114 transitions. [2019-12-18 20:35:32,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:35:32,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:32,282 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 20:35:32,282 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 20:35:32,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:32,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1706121534, now seen corresponding path program 2 times [2019-12-18 20:35:32,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:32,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108106307] [2019-12-18 20:35:32,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:32,342 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 20:35:32,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108106307] [2019-12-18 20:35:32,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:32,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:35:32,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928940669] [2019-12-18 20:35:32,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:35:32,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:32,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:35:32,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:35:32,344 INFO L87 Difference]: Start difference. First operand 24653 states and 75114 transitions. Second operand 3 states. [2019-12-18 20:35:32,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:32,455 INFO L93 Difference]: Finished difference Result 24653 states and 74278 transitions. [2019-12-18 20:35:32,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:35:32,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 20:35:32,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:32,509 INFO L225 Difference]: With dead ends: 24653 [2019-12-18 20:35:32,509 INFO L226 Difference]: Without dead ends: 24653 [2019-12-18 20:35:32,510 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 20:35:32,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24653 states. [2019-12-18 20:35:32,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24653 to 24525. [2019-12-18 20:35:32,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24525 states. [2019-12-18 20:35:32,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24525 states to 24525 states and 73922 transitions. [2019-12-18 20:35:32,996 INFO L78 Accepts]: Start accepts. Automaton has 24525 states and 73922 transitions. Word has length 40 [2019-12-18 20:35:32,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:32,996 INFO L462 AbstractCegarLoop]: Abstraction has 24525 states and 73922 transitions. [2019-12-18 20:35:32,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:35:32,996 INFO L276 IsEmpty]: Start isEmpty. Operand 24525 states and 73922 transitions. [2019-12-18 20:35:33,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 20:35:33,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:33,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, 1] [2019-12-18 20:35:33,020 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 20:35:33,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:33,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1403753262, now seen corresponding path program 1 times [2019-12-18 20:35:33,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:33,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889406216] [2019-12-18 20:35:33,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:35:33,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889406216] [2019-12-18 20:35:33,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:33,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:35:33,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952673242] [2019-12-18 20:35:33,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:35:33,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:33,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:35:33,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:35:33,081 INFO L87 Difference]: Start difference. First operand 24525 states and 73922 transitions. Second operand 5 states. [2019-12-18 20:35:33,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:33,200 INFO L93 Difference]: Finished difference Result 23089 states and 70583 transitions. [2019-12-18 20:35:33,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:35:33,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 20:35:33,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:33,252 INFO L225 Difference]: With dead ends: 23089 [2019-12-18 20:35:33,252 INFO L226 Difference]: Without dead ends: 23089 [2019-12-18 20:35:33,254 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 20:35:33,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23089 states. [2019-12-18 20:35:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23089 to 22081. [2019-12-18 20:35:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22081 states. [2019-12-18 20:35:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22081 states to 22081 states and 67864 transitions. [2019-12-18 20:35:33,689 INFO L78 Accepts]: Start accepts. Automaton has 22081 states and 67864 transitions. Word has length 41 [2019-12-18 20:35:33,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:33,689 INFO L462 AbstractCegarLoop]: Abstraction has 22081 states and 67864 transitions. [2019-12-18 20:35:33,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:35:33,689 INFO L276 IsEmpty]: Start isEmpty. Operand 22081 states and 67864 transitions. [2019-12-18 20:35:33,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:35:33,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:33,719 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 20:35:33,720 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 20:35:33,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:33,720 INFO L82 PathProgramCache]: Analyzing trace with hash 384634377, now seen corresponding path program 1 times [2019-12-18 20:35:33,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:33,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803292457] [2019-12-18 20:35:33,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:35:33,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803292457] [2019-12-18 20:35:33,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:33,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:35:33,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401186978] [2019-12-18 20:35:33,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:35:33,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:33,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:35:33,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:35:33,816 INFO L87 Difference]: Start difference. First operand 22081 states and 67864 transitions. Second operand 6 states. [2019-12-18 20:35:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:34,876 INFO L93 Difference]: Finished difference Result 29004 states and 88036 transitions. [2019-12-18 20:35:34,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 20:35:34,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 20:35:34,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:34,917 INFO L225 Difference]: With dead ends: 29004 [2019-12-18 20:35:34,917 INFO L226 Difference]: Without dead ends: 29004 [2019-12-18 20:35:34,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:35:35,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29004 states. [2019-12-18 20:35:35,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29004 to 23316. [2019-12-18 20:35:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23316 states. [2019-12-18 20:35:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23316 states to 23316 states and 71577 transitions. [2019-12-18 20:35:35,325 INFO L78 Accepts]: Start accepts. Automaton has 23316 states and 71577 transitions. Word has length 65 [2019-12-18 20:35:35,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:35,325 INFO L462 AbstractCegarLoop]: Abstraction has 23316 states and 71577 transitions. [2019-12-18 20:35:35,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:35:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 23316 states and 71577 transitions. [2019-12-18 20:35:35,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:35:35,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:35,355 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 20:35:35,356 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 20:35:35,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:35,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1572101585, now seen corresponding path program 2 times [2019-12-18 20:35:35,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:35,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743379475] [2019-12-18 20:35:35,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:35,439 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 20:35:35,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743379475] [2019-12-18 20:35:35,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:35,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:35:35,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073125496] [2019-12-18 20:35:35,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:35:35,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:35,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:35:35,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:35:35,442 INFO L87 Difference]: Start difference. First operand 23316 states and 71577 transitions. Second operand 3 states. [2019-12-18 20:35:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:35,638 INFO L93 Difference]: Finished difference Result 29439 states and 89258 transitions. [2019-12-18 20:35:35,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:35:35,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 20:35:35,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:35,696 INFO L225 Difference]: With dead ends: 29439 [2019-12-18 20:35:35,696 INFO L226 Difference]: Without dead ends: 29439 [2019-12-18 20:35:35,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 20:35:35,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29439 states. [2019-12-18 20:35:36,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29439 to 24569. [2019-12-18 20:35:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24569 states. [2019-12-18 20:35:36,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24569 states to 24569 states and 75239 transitions. [2019-12-18 20:35:36,118 INFO L78 Accepts]: Start accepts. Automaton has 24569 states and 75239 transitions. Word has length 65 [2019-12-18 20:35:36,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:36,118 INFO L462 AbstractCegarLoop]: Abstraction has 24569 states and 75239 transitions. [2019-12-18 20:35:36,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:35:36,118 INFO L276 IsEmpty]: Start isEmpty. Operand 24569 states and 75239 transitions. [2019-12-18 20:35:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:35:36,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:36,147 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 20:35:36,147 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 20:35:36,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:36,147 INFO L82 PathProgramCache]: Analyzing trace with hash 158811229, now seen corresponding path program 1 times [2019-12-18 20:35:36,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:36,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778398614] [2019-12-18 20:35:36,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:36,258 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 20:35:36,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778398614] [2019-12-18 20:35:36,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:36,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:35:36,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062622209] [2019-12-18 20:35:36,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:35:36,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:36,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:35:36,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:35:36,260 INFO L87 Difference]: Start difference. First operand 24569 states and 75239 transitions. Second operand 8 states. [2019-12-18 20:35:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:38,536 INFO L93 Difference]: Finished difference Result 35257 states and 105630 transitions. [2019-12-18 20:35:38,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 20:35:38,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 20:35:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:38,597 INFO L225 Difference]: With dead ends: 35257 [2019-12-18 20:35:38,598 INFO L226 Difference]: Without dead ends: 35257 [2019-12-18 20:35:38,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 20:35:38,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35257 states. [2019-12-18 20:35:39,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35257 to 24504. [2019-12-18 20:35:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24504 states. [2019-12-18 20:35:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24504 states to 24504 states and 74898 transitions. [2019-12-18 20:35:39,361 INFO L78 Accepts]: Start accepts. Automaton has 24504 states and 74898 transitions. Word has length 66 [2019-12-18 20:35:39,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:39,361 INFO L462 AbstractCegarLoop]: Abstraction has 24504 states and 74898 transitions. [2019-12-18 20:35:39,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:35:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 24504 states and 74898 transitions. [2019-12-18 20:35:39,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:35:39,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:39,396 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 20:35:39,396 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 20:35:39,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:39,396 INFO L82 PathProgramCache]: Analyzing trace with hash 27554715, now seen corresponding path program 2 times [2019-12-18 20:35:39,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:39,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556299000] [2019-12-18 20:35:39,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:39,459 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 20:35:39,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556299000] [2019-12-18 20:35:39,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:39,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:35:39,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383281334] [2019-12-18 20:35:39,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:35:39,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:39,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:35:39,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:35:39,463 INFO L87 Difference]: Start difference. First operand 24504 states and 74898 transitions. Second operand 3 states. [2019-12-18 20:35:39,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:39,553 INFO L93 Difference]: Finished difference Result 24503 states and 74896 transitions. [2019-12-18 20:35:39,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:35:39,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 20:35:39,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:39,586 INFO L225 Difference]: With dead ends: 24503 [2019-12-18 20:35:39,586 INFO L226 Difference]: Without dead ends: 24503 [2019-12-18 20:35:39,586 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 20:35:39,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24503 states. [2019-12-18 20:35:39,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24503 to 19681. [2019-12-18 20:35:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19681 states. [2019-12-18 20:35:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19681 states to 19681 states and 60996 transitions. [2019-12-18 20:35:39,914 INFO L78 Accepts]: Start accepts. Automaton has 19681 states and 60996 transitions. Word has length 66 [2019-12-18 20:35:39,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:39,914 INFO L462 AbstractCegarLoop]: Abstraction has 19681 states and 60996 transitions. [2019-12-18 20:35:39,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:35:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 19681 states and 60996 transitions. [2019-12-18 20:35:39,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:35:39,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:39,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:35:39,934 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 20:35:39,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:39,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1309527475, now seen corresponding path program 1 times [2019-12-18 20:35:39,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:39,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330243320] [2019-12-18 20:35:39,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:40,910 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 20:35:40,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330243320] [2019-12-18 20:35:40,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:40,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 20:35:40,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712526869] [2019-12-18 20:35:40,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 20:35:40,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:40,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 20:35:40,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:35:40,912 INFO L87 Difference]: Start difference. First operand 19681 states and 60996 transitions. Second operand 16 states. [2019-12-18 20:35:43,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:43,736 INFO L93 Difference]: Finished difference Result 35042 states and 106900 transitions. [2019-12-18 20:35:43,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 20:35:43,736 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 20:35:43,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:43,779 INFO L225 Difference]: With dead ends: 35042 [2019-12-18 20:35:43,779 INFO L226 Difference]: Without dead ends: 31320 [2019-12-18 20:35:43,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=291, Invalid=1601, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 20:35:43,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31320 states. [2019-12-18 20:35:44,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31320 to 27125. [2019-12-18 20:35:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27125 states. [2019-12-18 20:35:44,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27125 states to 27125 states and 83097 transitions. [2019-12-18 20:35:44,191 INFO L78 Accepts]: Start accepts. Automaton has 27125 states and 83097 transitions. Word has length 67 [2019-12-18 20:35:44,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:44,191 INFO L462 AbstractCegarLoop]: Abstraction has 27125 states and 83097 transitions. [2019-12-18 20:35:44,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 20:35:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand 27125 states and 83097 transitions. [2019-12-18 20:35:44,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:35:44,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:44,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:35:44,218 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 20:35:44,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:44,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1955892329, now seen corresponding path program 2 times [2019-12-18 20:35:44,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:44,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378110323] [2019-12-18 20:35:44,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:44,713 WARN L192 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2019-12-18 20:35:45,156 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 20:35:45,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378110323] [2019-12-18 20:35:45,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:45,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 20:35:45,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34263921] [2019-12-18 20:35:45,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 20:35:45,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:45,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 20:35:45,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-18 20:35:45,160 INFO L87 Difference]: Start difference. First operand 27125 states and 83097 transitions. Second operand 15 states. [2019-12-18 20:35:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:35:52,489 INFO L93 Difference]: Finished difference Result 78330 states and 237815 transitions. [2019-12-18 20:35:52,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-12-18 20:35:52,490 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 20:35:52,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:35:52,577 INFO L225 Difference]: With dead ends: 78330 [2019-12-18 20:35:52,577 INFO L226 Difference]: Without dead ends: 51764 [2019-12-18 20:35:52,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2237 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=937, Invalid=5705, Unknown=0, NotChecked=0, Total=6642 [2019-12-18 20:35:52,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51764 states. [2019-12-18 20:35:53,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51764 to 30257. [2019-12-18 20:35:53,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30257 states. [2019-12-18 20:35:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30257 states to 30257 states and 92626 transitions. [2019-12-18 20:35:53,656 INFO L78 Accepts]: Start accepts. Automaton has 30257 states and 92626 transitions. Word has length 67 [2019-12-18 20:35:53,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:35:53,657 INFO L462 AbstractCegarLoop]: Abstraction has 30257 states and 92626 transitions. [2019-12-18 20:35:53,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 20:35:53,657 INFO L276 IsEmpty]: Start isEmpty. Operand 30257 states and 92626 transitions. [2019-12-18 20:35:53,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:35:53,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:35:53,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:35:53,690 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 20:35:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:35:53,690 INFO L82 PathProgramCache]: Analyzing trace with hash -886085509, now seen corresponding path program 3 times [2019-12-18 20:35:53,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:35:53,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028055030] [2019-12-18 20:35:53,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:35:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:35:54,325 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 20:35:54,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028055030] [2019-12-18 20:35:54,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:35:54,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 20:35:54,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018229703] [2019-12-18 20:35:54,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 20:35:54,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:35:54,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 20:35:54,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-18 20:35:54,327 INFO L87 Difference]: Start difference. First operand 30257 states and 92626 transitions. Second operand 18 states. [2019-12-18 20:36:00,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:36:00,915 INFO L93 Difference]: Finished difference Result 51742 states and 156361 transitions. [2019-12-18 20:36:00,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-18 20:36:00,916 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-18 20:36:00,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:36:00,974 INFO L225 Difference]: With dead ends: 51742 [2019-12-18 20:36:00,975 INFO L226 Difference]: Without dead ends: 38832 [2019-12-18 20:36:00,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=499, Invalid=2923, Unknown=0, NotChecked=0, Total=3422 [2019-12-18 20:36:01,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38832 states. [2019-12-18 20:36:01,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38832 to 30742. [2019-12-18 20:36:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30742 states. [2019-12-18 20:36:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30742 states to 30742 states and 93476 transitions. [2019-12-18 20:36:01,912 INFO L78 Accepts]: Start accepts. Automaton has 30742 states and 93476 transitions. Word has length 67 [2019-12-18 20:36:01,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:36:01,912 INFO L462 AbstractCegarLoop]: Abstraction has 30742 states and 93476 transitions. [2019-12-18 20:36:01,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 20:36:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 30742 states and 93476 transitions. [2019-12-18 20:36:01,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:36:01,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:36:01,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:36:01,944 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 20:36:01,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:36:01,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1501975895, now seen corresponding path program 4 times [2019-12-18 20:36:01,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:36:01,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553366017] [2019-12-18 20:36:01,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:36:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:36:02,532 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 20:36:02,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553366017] [2019-12-18 20:36:02,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:36:02,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 20:36:02,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913117757] [2019-12-18 20:36:02,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 20:36:02,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:36:02,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 20:36:02,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-18 20:36:02,534 INFO L87 Difference]: Start difference. First operand 30742 states and 93476 transitions. Second operand 19 states. [2019-12-18 20:36:15,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:36:15,929 INFO L93 Difference]: Finished difference Result 53387 states and 160427 transitions. [2019-12-18 20:36:15,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-12-18 20:36:15,931 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-18 20:36:15,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:36:16,023 INFO L225 Difference]: With dead ends: 53387 [2019-12-18 20:36:16,023 INFO L226 Difference]: Without dead ends: 37885 [2019-12-18 20:36:16,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4804 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1397, Invalid=12645, Unknown=0, NotChecked=0, Total=14042 [2019-12-18 20:36:16,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37885 states. [2019-12-18 20:36:16,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37885 to 30374. [2019-12-18 20:36:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30374 states. [2019-12-18 20:36:16,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30374 states to 30374 states and 92248 transitions. [2019-12-18 20:36:16,608 INFO L78 Accepts]: Start accepts. Automaton has 30374 states and 92248 transitions. Word has length 67 [2019-12-18 20:36:16,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:36:16,608 INFO L462 AbstractCegarLoop]: Abstraction has 30374 states and 92248 transitions. [2019-12-18 20:36:16,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 20:36:16,608 INFO L276 IsEmpty]: Start isEmpty. Operand 30374 states and 92248 transitions. [2019-12-18 20:36:16,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:36:16,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:36:16,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:36:16,642 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 20:36:16,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:36:16,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1653481189, now seen corresponding path program 5 times [2019-12-18 20:36:16,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:36:16,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203500870] [2019-12-18 20:36:16,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:36:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:36:16,708 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 20:36:16,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203500870] [2019-12-18 20:36:16,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:36:16,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:36:16,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511318833] [2019-12-18 20:36:16,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:36:16,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:36:16,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:36:16,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:36:16,710 INFO L87 Difference]: Start difference. First operand 30374 states and 92248 transitions. Second operand 7 states. [2019-12-18 20:36:17,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:36:17,194 INFO L93 Difference]: Finished difference Result 67458 states and 203423 transitions. [2019-12-18 20:36:17,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:36:17,194 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-18 20:36:17,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:36:17,259 INFO L225 Difference]: With dead ends: 67458 [2019-12-18 20:36:17,259 INFO L226 Difference]: Without dead ends: 47934 [2019-12-18 20:36:17,259 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 20:36:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47934 states. [2019-12-18 20:36:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47934 to 29693. [2019-12-18 20:36:17,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29693 states. [2019-12-18 20:36:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29693 states to 29693 states and 89905 transitions. [2019-12-18 20:36:17,845 INFO L78 Accepts]: Start accepts. Automaton has 29693 states and 89905 transitions. Word has length 67 [2019-12-18 20:36:17,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:36:17,845 INFO L462 AbstractCegarLoop]: Abstraction has 29693 states and 89905 transitions. [2019-12-18 20:36:17,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:36:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 29693 states and 89905 transitions. [2019-12-18 20:36:17,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:36:17,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:36:17,881 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:36:17,881 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 20:36:17,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:36:17,881 INFO L82 PathProgramCache]: Analyzing trace with hash 108197429, now seen corresponding path program 6 times [2019-12-18 20:36:17,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:36:17,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883600001] [2019-12-18 20:36:17,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:36:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:36:19,111 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 20:36:19,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883600001] [2019-12-18 20:36:19,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:36:19,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-18 20:36:19,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159596639] [2019-12-18 20:36:19,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 20:36:19,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:36:19,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 20:36:19,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2019-12-18 20:36:19,113 INFO L87 Difference]: Start difference. First operand 29693 states and 89905 transitions. Second operand 24 states. [2019-12-18 20:36:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:36:31,332 INFO L93 Difference]: Finished difference Result 34871 states and 104144 transitions. [2019-12-18 20:36:31,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-12-18 20:36:31,333 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-12-18 20:36:31,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:36:31,375 INFO L225 Difference]: With dead ends: 34871 [2019-12-18 20:36:31,375 INFO L226 Difference]: Without dead ends: 32054 [2019-12-18 20:36:31,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2898 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=965, Invalid=8935, Unknown=0, NotChecked=0, Total=9900 [2019-12-18 20:36:31,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32054 states. [2019-12-18 20:36:31,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32054 to 29814. [2019-12-18 20:36:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29814 states. [2019-12-18 20:36:31,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29814 states to 29814 states and 90091 transitions. [2019-12-18 20:36:31,813 INFO L78 Accepts]: Start accepts. Automaton has 29814 states and 90091 transitions. Word has length 67 [2019-12-18 20:36:31,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:36:31,813 INFO L462 AbstractCegarLoop]: Abstraction has 29814 states and 90091 transitions. [2019-12-18 20:36:31,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 20:36:31,813 INFO L276 IsEmpty]: Start isEmpty. Operand 29814 states and 90091 transitions. [2019-12-18 20:36:31,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:36:31,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:36:31,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:36:31,844 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 20:36:31,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:36:31,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1601969445, now seen corresponding path program 7 times [2019-12-18 20:36:31,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:36:31,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554523047] [2019-12-18 20:36:31,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:36:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:36:32,426 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 20:36:32,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554523047] [2019-12-18 20:36:32,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:36:32,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 20:36:32,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665666782] [2019-12-18 20:36:32,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 20:36:32,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:36:32,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 20:36:32,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-12-18 20:36:32,428 INFO L87 Difference]: Start difference. First operand 29814 states and 90091 transitions. Second operand 19 states. [2019-12-18 20:36:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:36:37,470 INFO L93 Difference]: Finished difference Result 39117 states and 117285 transitions. [2019-12-18 20:36:37,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-18 20:36:37,470 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-18 20:36:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:36:37,521 INFO L225 Difference]: With dead ends: 39117 [2019-12-18 20:36:37,521 INFO L226 Difference]: Without dead ends: 35874 [2019-12-18 20:36:37,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=324, Invalid=1746, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 20:36:37,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35874 states. [2019-12-18 20:36:37,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35874 to 30022. [2019-12-18 20:36:37,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30022 states. [2019-12-18 20:36:38,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30022 states to 30022 states and 90677 transitions. [2019-12-18 20:36:38,011 INFO L78 Accepts]: Start accepts. Automaton has 30022 states and 90677 transitions. Word has length 67 [2019-12-18 20:36:38,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:36:38,012 INFO L462 AbstractCegarLoop]: Abstraction has 30022 states and 90677 transitions. [2019-12-18 20:36:38,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 20:36:38,012 INFO L276 IsEmpty]: Start isEmpty. Operand 30022 states and 90677 transitions. [2019-12-18 20:36:38,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:36:38,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:36:38,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:36:38,048 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 20:36:38,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:36:38,048 INFO L82 PathProgramCache]: Analyzing trace with hash 629869935, now seen corresponding path program 8 times [2019-12-18 20:36:38,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:36:38,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464481927] [2019-12-18 20:36:38,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:36:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:36:38,564 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2019-12-18 20:36:38,984 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 20:36:38,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464481927] [2019-12-18 20:36:38,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:36:38,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 20:36:38,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606946915] [2019-12-18 20:36:38,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 20:36:38,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:36:38,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 20:36:38,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:36:38,986 INFO L87 Difference]: Start difference. First operand 30022 states and 90677 transitions. Second operand 16 states. [2019-12-18 20:36:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:36:44,669 INFO L93 Difference]: Finished difference Result 52513 states and 157172 transitions. [2019-12-18 20:36:44,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 20:36:44,670 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 20:36:44,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:36:44,738 INFO L225 Difference]: With dead ends: 52513 [2019-12-18 20:36:44,738 INFO L226 Difference]: Without dead ends: 49852 [2019-12-18 20:36:44,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=445, Invalid=2635, Unknown=0, NotChecked=0, Total=3080 [2019-12-18 20:36:44,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49852 states. [2019-12-18 20:36:45,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49852 to 29826. [2019-12-18 20:36:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29826 states. [2019-12-18 20:36:45,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29826 states to 29826 states and 90186 transitions. [2019-12-18 20:36:45,331 INFO L78 Accepts]: Start accepts. Automaton has 29826 states and 90186 transitions. Word has length 67 [2019-12-18 20:36:45,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:36:45,331 INFO L462 AbstractCegarLoop]: Abstraction has 29826 states and 90186 transitions. [2019-12-18 20:36:45,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 20:36:45,331 INFO L276 IsEmpty]: Start isEmpty. Operand 29826 states and 90186 transitions. [2019-12-18 20:36:45,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:36:45,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:36:45,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:36:45,364 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 20:36:45,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:36:45,365 INFO L82 PathProgramCache]: Analyzing trace with hash 974475331, now seen corresponding path program 9 times [2019-12-18 20:36:45,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:36:45,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803725902] [2019-12-18 20:36:45,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:36:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:36:46,116 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 20:36:46,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803725902] [2019-12-18 20:36:46,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:36:46,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 20:36:46,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083015754] [2019-12-18 20:36:46,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 20:36:46,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:36:46,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 20:36:46,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-12-18 20:36:46,117 INFO L87 Difference]: Start difference. First operand 29826 states and 90186 transitions. Second operand 20 states. [2019-12-18 20:36:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:36:52,403 INFO L93 Difference]: Finished difference Result 51523 states and 153189 transitions. [2019-12-18 20:36:52,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-18 20:36:52,403 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-18 20:36:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:36:52,464 INFO L225 Difference]: With dead ends: 51523 [2019-12-18 20:36:52,464 INFO L226 Difference]: Without dead ends: 41936 [2019-12-18 20:36:52,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=455, Invalid=2515, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 20:36:52,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41936 states. [2019-12-18 20:36:52,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41936 to 30723. [2019-12-18 20:36:52,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30723 states. [2019-12-18 20:36:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30723 states to 30723 states and 92525 transitions. [2019-12-18 20:36:53,010 INFO L78 Accepts]: Start accepts. Automaton has 30723 states and 92525 transitions. Word has length 67 [2019-12-18 20:36:53,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:36:53,010 INFO L462 AbstractCegarLoop]: Abstraction has 30723 states and 92525 transitions. [2019-12-18 20:36:53,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 20:36:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 30723 states and 92525 transitions. [2019-12-18 20:36:53,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:36:53,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:36:53,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:36:53,043 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 20:36:53,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:36:53,043 INFO L82 PathProgramCache]: Analyzing trace with hash 358584945, now seen corresponding path program 10 times [2019-12-18 20:36:53,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:36:53,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675881996] [2019-12-18 20:36:53,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:36:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:36:53,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 20:36:53,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675881996] [2019-12-18 20:36:53,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:36:53,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 20:36:53,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082206747] [2019-12-18 20:36:53,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 20:36:53,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:36:53,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 20:36:53,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-12-18 20:36:53,851 INFO L87 Difference]: Start difference. First operand 30723 states and 92525 transitions. Second operand 21 states. [2019-12-18 20:37:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:37:03,270 INFO L93 Difference]: Finished difference Result 49249 states and 146316 transitions. [2019-12-18 20:37:03,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-12-18 20:37:03,270 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-18 20:37:03,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:37:03,329 INFO L225 Difference]: With dead ends: 49249 [2019-12-18 20:37:03,330 INFO L226 Difference]: Without dead ends: 41781 [2019-12-18 20:37:03,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2838 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1064, Invalid=7678, Unknown=0, NotChecked=0, Total=8742 [2019-12-18 20:37:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41781 states. [2019-12-18 20:37:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41781 to 30677. [2019-12-18 20:37:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30677 states. [2019-12-18 20:37:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30677 states to 30677 states and 92338 transitions. [2019-12-18 20:37:03,875 INFO L78 Accepts]: Start accepts. Automaton has 30677 states and 92338 transitions. Word has length 67 [2019-12-18 20:37:03,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:37:03,875 INFO L462 AbstractCegarLoop]: Abstraction has 30677 states and 92338 transitions. [2019-12-18 20:37:03,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 20:37:03,875 INFO L276 IsEmpty]: Start isEmpty. Operand 30677 states and 92338 transitions. [2019-12-18 20:37:03,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:37:03,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:37:03,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:37:03,911 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 20:37:03,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:37:03,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1670411831, now seen corresponding path program 11 times [2019-12-18 20:37:03,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:37:03,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987711435] [2019-12-18 20:37:03,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:37:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:37:04,152 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 20:37:04,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987711435] [2019-12-18 20:37:04,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:37:04,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:37:04,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009730050] [2019-12-18 20:37:04,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:37:04,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:37:04,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:37:04,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:37:04,154 INFO L87 Difference]: Start difference. First operand 30677 states and 92338 transitions. Second operand 11 states. [2019-12-18 20:37:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:37:05,636 INFO L93 Difference]: Finished difference Result 58042 states and 175529 transitions. [2019-12-18 20:37:05,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 20:37:05,636 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 20:37:05,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:37:05,697 INFO L225 Difference]: With dead ends: 58042 [2019-12-18 20:37:05,698 INFO L226 Difference]: Without dead ends: 40596 [2019-12-18 20:37:05,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=861, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 20:37:05,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40596 states. [2019-12-18 20:37:06,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40596 to 22819. [2019-12-18 20:37:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22819 states. [2019-12-18 20:37:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22819 states to 22819 states and 69787 transitions. [2019-12-18 20:37:06,368 INFO L78 Accepts]: Start accepts. Automaton has 22819 states and 69787 transitions. Word has length 67 [2019-12-18 20:37:06,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:37:06,369 INFO L462 AbstractCegarLoop]: Abstraction has 22819 states and 69787 transitions. [2019-12-18 20:37:06,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:37:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 22819 states and 69787 transitions. [2019-12-18 20:37:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:37:06,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:37:06,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:37:06,395 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 20:37:06,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:37:06,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1670572367, now seen corresponding path program 12 times [2019-12-18 20:37:06,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:37:06,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684387309] [2019-12-18 20:37:06,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:37:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:37:06,857 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 20:37:06,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684387309] [2019-12-18 20:37:06,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:37:06,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 20:37:06,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851930763] [2019-12-18 20:37:06,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 20:37:06,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:37:06,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 20:37:06,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:37:06,859 INFO L87 Difference]: Start difference. First operand 22819 states and 69787 transitions. Second operand 16 states. [2019-12-18 20:37:11,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:37:11,358 INFO L93 Difference]: Finished difference Result 44324 states and 132894 transitions. [2019-12-18 20:37:11,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-18 20:37:11,359 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 20:37:11,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:37:11,419 INFO L225 Difference]: With dead ends: 44324 [2019-12-18 20:37:11,419 INFO L226 Difference]: Without dead ends: 43048 [2019-12-18 20:37:11,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=504, Invalid=2688, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 20:37:11,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43048 states. [2019-12-18 20:37:11,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43048 to 22823. [2019-12-18 20:37:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22823 states. [2019-12-18 20:37:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22823 states to 22823 states and 69799 transitions. [2019-12-18 20:37:11,913 INFO L78 Accepts]: Start accepts. Automaton has 22823 states and 69799 transitions. Word has length 67 [2019-12-18 20:37:11,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:37:11,913 INFO L462 AbstractCegarLoop]: Abstraction has 22823 states and 69799 transitions. [2019-12-18 20:37:11,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 20:37:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 22823 states and 69799 transitions. [2019-12-18 20:37:11,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:37:11,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:37:11,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:37:11,940 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 20:37:11,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:37:11,941 INFO L82 PathProgramCache]: Analyzing trace with hash -505230993, now seen corresponding path program 13 times [2019-12-18 20:37:11,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:37:11,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659395130] [2019-12-18 20:37:11,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:37:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:37:12,410 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 20:37:12,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659395130] [2019-12-18 20:37:12,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:37:12,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 20:37:12,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238921009] [2019-12-18 20:37:12,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 20:37:12,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:37:12,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 20:37:12,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:37:12,412 INFO L87 Difference]: Start difference. First operand 22823 states and 69799 transitions. Second operand 16 states. [2019-12-18 20:37:17,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:37:17,748 INFO L93 Difference]: Finished difference Result 43385 states and 130468 transitions. [2019-12-18 20:37:17,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 20:37:17,749 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 20:37:17,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:37:17,809 INFO L225 Difference]: With dead ends: 43385 [2019-12-18 20:37:17,809 INFO L226 Difference]: Without dead ends: 42720 [2019-12-18 20:37:17,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=416, Invalid=2236, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 20:37:17,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42720 states. [2019-12-18 20:37:18,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42720 to 22823. [2019-12-18 20:37:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22823 states. [2019-12-18 20:37:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22823 states to 22823 states and 69795 transitions. [2019-12-18 20:37:18,272 INFO L78 Accepts]: Start accepts. Automaton has 22823 states and 69795 transitions. Word has length 67 [2019-12-18 20:37:18,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:37:18,272 INFO L462 AbstractCegarLoop]: Abstraction has 22823 states and 69795 transitions. [2019-12-18 20:37:18,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 20:37:18,273 INFO L276 IsEmpty]: Start isEmpty. Operand 22823 states and 69795 transitions. [2019-12-18 20:37:18,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:37:18,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:37:18,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:37:18,295 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 20:37:18,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:37:18,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1849716009, now seen corresponding path program 14 times [2019-12-18 20:37:18,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:37:18,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372811891] [2019-12-18 20:37:18,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:37:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:37:18,632 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 20:37:18,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372811891] [2019-12-18 20:37:18,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:37:18,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:37:18,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911558032] [2019-12-18 20:37:18,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:37:18,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:37:18,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:37:18,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:37:18,635 INFO L87 Difference]: Start difference. First operand 22823 states and 69795 transitions. Second operand 11 states. [2019-12-18 20:37:19,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:37:19,958 INFO L93 Difference]: Finished difference Result 26561 states and 80490 transitions. [2019-12-18 20:37:19,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 20:37:19,959 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 20:37:19,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:37:19,994 INFO L225 Difference]: With dead ends: 26561 [2019-12-18 20:37:19,994 INFO L226 Difference]: Without dead ends: 25619 [2019-12-18 20:37:19,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-12-18 20:37:20,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25619 states. [2019-12-18 20:37:20,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25619 to 22387. [2019-12-18 20:37:20,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22387 states. [2019-12-18 20:37:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22387 states to 22387 states and 68560 transitions. [2019-12-18 20:37:20,329 INFO L78 Accepts]: Start accepts. Automaton has 22387 states and 68560 transitions. Word has length 67 [2019-12-18 20:37:20,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:37:20,330 INFO L462 AbstractCegarLoop]: Abstraction has 22387 states and 68560 transitions. [2019-12-18 20:37:20,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:37:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 22387 states and 68560 transitions. [2019-12-18 20:37:20,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:37:20,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:37:20,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:37:20,352 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 20:37:20,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:37:20,352 INFO L82 PathProgramCache]: Analyzing trace with hash 703426153, now seen corresponding path program 15 times [2019-12-18 20:37:20,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:37:20,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807726894] [2019-12-18 20:37:20,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:37:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:37:20,632 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 20:37:20,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807726894] [2019-12-18 20:37:20,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:37:20,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:37:20,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596594877] [2019-12-18 20:37:20,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:37:20,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:37:20,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:37:20,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:37:20,634 INFO L87 Difference]: Start difference. First operand 22387 states and 68560 transitions. Second operand 11 states. [2019-12-18 20:37:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:37:22,346 INFO L93 Difference]: Finished difference Result 27149 states and 82367 transitions. [2019-12-18 20:37:22,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 20:37:22,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 20:37:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:37:22,385 INFO L225 Difference]: With dead ends: 27149 [2019-12-18 20:37:22,385 INFO L226 Difference]: Without dead ends: 26754 [2019-12-18 20:37:22,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-18 20:37:22,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26754 states. [2019-12-18 20:37:22,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26754 to 22199. [2019-12-18 20:37:22,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22199 states. [2019-12-18 20:37:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22199 states to 22199 states and 68086 transitions. [2019-12-18 20:37:22,978 INFO L78 Accepts]: Start accepts. Automaton has 22199 states and 68086 transitions. Word has length 67 [2019-12-18 20:37:22,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:37:22,979 INFO L462 AbstractCegarLoop]: Abstraction has 22199 states and 68086 transitions. [2019-12-18 20:37:22,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:37:22,979 INFO L276 IsEmpty]: Start isEmpty. Operand 22199 states and 68086 transitions. [2019-12-18 20:37:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:37:23,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:37:23,006 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:37:23,006 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 20:37:23,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:37:23,006 INFO L82 PathProgramCache]: Analyzing trace with hash -185379867, now seen corresponding path program 16 times [2019-12-18 20:37:23,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:37:23,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451489508] [2019-12-18 20:37:23,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:37:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:37:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:37:23,109 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:37:23,110 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:37:23,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$r_buff1_thd2~0_19) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd0~0_24) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_20) (= |v_#NULL.offset_6| 0) (= 0 v_~z$flush_delayed~0_13) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t497~0.base_21| 4) |v_#length_21|) (= v_~__unbuffered_p2_EBX~0_16 0) (= 0 v_~z$r_buff1_thd3~0_52) (= 0 v_~z$r_buff1_thd1~0_18) (= (store .cse0 |v_ULTIMATE.start_main_~#t497~0.base_21| 1) |v_#valid_60|) (< 0 |v_#StackHeapBarrier_15|) (= v_~x~0_17 0) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~z$w_buff1_used~0_73) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~z$r_buff0_thd1~0_27 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t497~0.base_21|) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd3~0_80 0) (= v_~main$tmp_guard1~0_14 0) (= v_~z~0_27 0) (= 0 v_~y~0_8) (= (select .cse0 |v_ULTIMATE.start_main_~#t497~0.base_21|) 0) (= 0 |v_ULTIMATE.start_main_~#t497~0.offset_16|) (= 0 v_~z$w_buff0~0_25) (= 0 v_~__unbuffered_p2_EAX~0_14) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t497~0.base_21| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t497~0.base_21|) |v_ULTIMATE.start_main_~#t497~0.offset_16| 0))) (= v_~z$r_buff0_thd2~0_21 0) (= v_~z$w_buff0_used~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ULTIMATE.start_main_~#t498~0.offset=|v_ULTIMATE.start_main_~#t498~0.offset_15|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ULTIMATE.start_main_~#t499~0.base=|v_ULTIMATE.start_main_~#t499~0.base_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, ~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_80, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ULTIMATE.start_main_~#t497~0.base=|v_ULTIMATE.start_main_~#t497~0.base_21|, ~x~0=v_~x~0_17, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_25, ULTIMATE.start_main_~#t498~0.base=|v_ULTIMATE.start_main_~#t498~0.base_20|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21, ULTIMATE.start_main_~#t497~0.offset=|v_ULTIMATE.start_main_~#t497~0.offset_16|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ULTIMATE.start_main_~#t499~0.offset=|v_ULTIMATE.start_main_~#t499~0.offset_15|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t498~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t499~0.base, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~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, ULTIMATE.start_main_~#t497~0.base, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ULTIMATE.start_main_~#t498~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t497~0.offset, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t499~0.offset] because there is no mapped edge [2019-12-18 20:37:23,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= 1 v_~x~0_6) (= v_~z$r_buff0_thd0~0_16 v_~z$r_buff1_thd0~0_11) (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff1_thd3~0_33) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_18 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6)) (= v_~z$r_buff0_thd1~0_19 v_~z$r_buff1_thd1~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_18, ~x~0=v_~x~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~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, ~x~0] because there is no mapped edge [2019-12-18 20:37:23,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L825-1-->L827: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t498~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t498~0.base_11|) |v_ULTIMATE.start_main_~#t498~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t498~0.base_11| 4) |v_#length_15|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t498~0.base_11|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t498~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t498~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t498~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t498~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#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|, ULTIMATE.start_main_~#t498~0.offset=|v_ULTIMATE.start_main_~#t498~0.offset_10|, ULTIMATE.start_main_~#t498~0.base=|v_ULTIMATE.start_main_~#t498~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t498~0.offset, ULTIMATE.start_main_~#t498~0.base, #length] because there is no mapped edge [2019-12-18 20:37:23,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L827-1-->L829: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t499~0.base_12| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t499~0.base_12| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t499~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t499~0.offset_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t499~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t499~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t499~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t499~0.base_12|) |v_ULTIMATE.start_main_~#t499~0.offset_10| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t499~0.base=|v_ULTIMATE.start_main_~#t499~0.base_12|, #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_~#t499~0.offset=|v_ULTIMATE.start_main_~#t499~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t499~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t499~0.offset] because there is no mapped edge [2019-12-18 20:37:23,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In-1513072745 256) 0)) (.cse0 (= |P1Thread1of1ForFork2_#t~ite10_Out-1513072745| |P1Thread1of1ForFork2_#t~ite9_Out-1513072745|)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1513072745 256) 0))) (or (and (= ~z~0_In-1513072745 |P1Thread1of1ForFork2_#t~ite9_Out-1513072745|) .cse0 (or .cse1 .cse2)) (and (not .cse1) (= ~z$w_buff1~0_In-1513072745 |P1Thread1of1ForFork2_#t~ite9_Out-1513072745|) .cse0 (not .cse2)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1513072745, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1513072745, ~z$w_buff1~0=~z$w_buff1~0_In-1513072745, ~z~0=~z~0_In-1513072745} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1513072745|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1513072745, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1513072745|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1513072745, ~z$w_buff1~0=~z$w_buff1~0_In-1513072745, ~z~0=~z~0_In-1513072745} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 20:37:23,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L792-->L792-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1505903371 256) 0))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1505903371 256) 0))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In1505903371 256))) (= (mod ~z$w_buff0_used~0_In1505903371 256) 0) (and (= (mod ~z$r_buff1_thd3~0_In1505903371 256) 0) .cse0))) .cse1 (= ~z$w_buff1~0_In1505903371 |P2Thread1of1ForFork0_#t~ite23_Out1505903371|) (= |P2Thread1of1ForFork0_#t~ite23_Out1505903371| |P2Thread1of1ForFork0_#t~ite24_Out1505903371|)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite23_In1505903371| |P2Thread1of1ForFork0_#t~ite23_Out1505903371|) (= ~z$w_buff1~0_In1505903371 |P2Thread1of1ForFork0_#t~ite24_Out1505903371|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1505903371, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1505903371, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1505903371|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1505903371, ~z$w_buff1~0=~z$w_buff1~0_In1505903371, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1505903371, ~weak$$choice2~0=~weak$$choice2~0_In1505903371} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1505903371, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1505903371|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1505903371, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1505903371|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1505903371, ~z$w_buff1~0=~z$w_buff1~0_In1505903371, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1505903371, ~weak$$choice2~0=~weak$$choice2~0_In1505903371} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 20:37:23,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L794-->L794-8: Formula: (let ((.cse2 (= |P2Thread1of1ForFork0_#t~ite29_Out-1649082713| |P2Thread1of1ForFork0_#t~ite30_Out-1649082713|)) (.cse3 (= 0 (mod ~weak$$choice2~0_In-1649082713 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1649082713 256) 0)) (.cse5 (= 0 (mod ~z$w_buff0_used~0_In-1649082713 256))) (.cse6 (= 0 (mod ~z$r_buff0_thd3~0_In-1649082713 256))) (.cse4 (= 0 (mod ~z$w_buff1_used~0_In-1649082713 256)))) (or (let ((.cse1 (not .cse6))) (and (= |P2Thread1of1ForFork0_#t~ite29_Out-1649082713| |P2Thread1of1ForFork0_#t~ite28_Out-1649082713|) (or (not .cse0) .cse1) .cse2 (= 0 |P2Thread1of1ForFork0_#t~ite28_Out-1649082713|) .cse3 (or (not .cse4) .cse1) (not .cse5))) (and (= |P2Thread1of1ForFork0_#t~ite28_In-1649082713| |P2Thread1of1ForFork0_#t~ite28_Out-1649082713|) (or (and (= ~z$w_buff1_used~0_In-1649082713 |P2Thread1of1ForFork0_#t~ite30_Out-1649082713|) (= |P2Thread1of1ForFork0_#t~ite29_In-1649082713| |P2Thread1of1ForFork0_#t~ite29_Out-1649082713|) (not .cse3)) (and .cse2 .cse3 (or (and .cse0 .cse6) .cse5 (and .cse6 .cse4)) (= ~z$w_buff1_used~0_In-1649082713 |P2Thread1of1ForFork0_#t~ite29_Out-1649082713|)))))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In-1649082713|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1649082713, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1649082713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1649082713, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1649082713, ~weak$$choice2~0=~weak$$choice2~0_In-1649082713, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1649082713|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1649082713|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1649082713, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1649082713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1649082713, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1649082713, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1649082713|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1649082713|, ~weak$$choice2~0=~weak$$choice2~0_In-1649082713} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 20:37:23,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L795-->L796: Formula: (and (= v_~z$r_buff0_thd3~0_57 v_~z$r_buff0_thd3~0_56) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_8|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_56, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 20:37:23,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (= v_~z~0_21 v_~z$mem_tmp~0_5) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 20:37:23,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In315896116 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In315896116 256) 0)) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out315896116| |P2Thread1of1ForFork0_#t~ite38_Out315896116|))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In315896116 |P2Thread1of1ForFork0_#t~ite38_Out315896116|)) (and (= ~z$w_buff1~0_In315896116 |P2Thread1of1ForFork0_#t~ite38_Out315896116|) (not .cse1) (not .cse0) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In315896116, ~z$w_buff1_used~0=~z$w_buff1_used~0_In315896116, ~z$w_buff1~0=~z$w_buff1~0_In315896116, ~z~0=~z~0_In315896116} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out315896116|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out315896116|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In315896116, ~z$w_buff1_used~0=~z$w_buff1_used~0_In315896116, ~z$w_buff1~0=~z$w_buff1~0_In315896116, ~z~0=~z~0_In315896116} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 20:37:23,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1874303948 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1874303948 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1874303948 |P2Thread1of1ForFork0_#t~ite40_Out-1874303948|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1874303948|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1874303948, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1874303948} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1874303948, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1874303948|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1874303948} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 20:37:23,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1110887855 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In1110887855 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1110887855 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1110887855 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out1110887855| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite41_Out1110887855| ~z$w_buff1_used~0_In1110887855) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1110887855, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1110887855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1110887855, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1110887855} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1110887855, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1110887855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1110887855, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1110887855, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1110887855|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 20:37:23,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1832106780 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1832106780 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1832106780|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In1832106780 |P2Thread1of1ForFork0_#t~ite42_Out1832106780|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1832106780, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1832106780} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1832106780, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1832106780, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1832106780|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 20:37:23,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1634064351 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1634064351 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1634064351 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1634064351 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In1634064351 |P2Thread1of1ForFork0_#t~ite43_Out1634064351|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1634064351|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1634064351, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1634064351, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1634064351, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1634064351} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1634064351|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1634064351, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1634064351, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1634064351, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1634064351} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 20:37:23,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_47 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_47, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, 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 20:37:23,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1267993837 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1267993837 256)))) (or (and (= ~z$w_buff0_used~0_In-1267993837 |P0Thread1of1ForFork1_#t~ite5_Out-1267993837|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-1267993837| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1267993837, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1267993837} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1267993837|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1267993837, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1267993837} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 20:37:23,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1520585370 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-1520585370 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1520585370 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1520585370 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1520585370 |P0Thread1of1ForFork1_#t~ite6_Out-1520585370|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1520585370|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1520585370, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1520585370, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1520585370, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1520585370} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1520585370, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1520585370|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1520585370, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1520585370, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1520585370} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 20:37:23,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1396618480 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1396618480 256)))) (or (and (= ~z$r_buff0_thd1~0_Out1396618480 ~z$r_buff0_thd1~0_In1396618480) (or .cse0 .cse1)) (and (= ~z$r_buff0_thd1~0_Out1396618480 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1396618480, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1396618480} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1396618480, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1396618480|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1396618480} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:37:23,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1221145466 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1221145466 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1221145466 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In1221145466 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd1~0_In1221145466 |P0Thread1of1ForFork1_#t~ite8_Out1221145466|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1221145466|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1221145466, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1221145466, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1221145466, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1221145466} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1221145466|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1221145466, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1221145466, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1221145466, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1221145466} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 20:37:23,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_13 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_13, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} 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 20:37:23,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In2126629295 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In2126629295 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out2126629295| ~z$w_buff0_used~0_In2126629295)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out2126629295| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2126629295, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2126629295} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2126629295, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out2126629295|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2126629295} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 20:37:23,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1915366842 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1915366842 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1915366842 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-1915366842 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1915366842|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1915366842 |P1Thread1of1ForFork2_#t~ite12_Out-1915366842|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1915366842, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1915366842, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1915366842, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1915366842} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1915366842, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1915366842, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1915366842, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1915366842|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1915366842} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 20:37:23,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-2130339607 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2130339607 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In-2130339607 |P1Thread1of1ForFork2_#t~ite13_Out-2130339607|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-2130339607|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2130339607, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2130339607} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2130339607, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-2130339607|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2130339607} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 20:37:23,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In-1752392765 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1752392765 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1752392765 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1752392765 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1752392765|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite14_Out-1752392765| ~z$r_buff1_thd2~0_In-1752392765)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1752392765, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1752392765, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1752392765, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1752392765} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1752392765, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1752392765, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1752392765, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1752392765|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1752392765} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 20:37:23,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_15) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, 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 20:37:23,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:37:23,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-985304486 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-985304486 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-985304486| ~z~0_In-985304486)) (and (= |ULTIMATE.start_main_#t~ite47_Out-985304486| ~z$w_buff1~0_In-985304486) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-985304486, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-985304486, ~z$w_buff1~0=~z$w_buff1~0_In-985304486, ~z~0=~z~0_In-985304486} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-985304486, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-985304486|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-985304486, ~z$w_buff1~0=~z$w_buff1~0_In-985304486, ~z~0=~z~0_In-985304486} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 20:37:23,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_20 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-18 20:37:23,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In922614710 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In922614710 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out922614710| 0)) (and (= |ULTIMATE.start_main_#t~ite49_Out922614710| ~z$w_buff0_used~0_In922614710) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In922614710, ~z$w_buff0_used~0=~z$w_buff0_used~0_In922614710} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In922614710, ~z$w_buff0_used~0=~z$w_buff0_used~0_In922614710, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out922614710|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 20:37:23,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1755560096 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1755560096 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1755560096 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1755560096 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out1755560096| ~z$w_buff1_used~0_In1755560096) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out1755560096| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1755560096, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1755560096, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1755560096, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1755560096} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1755560096|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1755560096, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1755560096, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1755560096, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1755560096} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 20:37:23,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-126563823 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-126563823 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-126563823| 0)) (and (= ~z$r_buff0_thd0~0_In-126563823 |ULTIMATE.start_main_#t~ite51_Out-126563823|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-126563823, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-126563823} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-126563823, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-126563823|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-126563823} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 20:37:23,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1549495830 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1549495830 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1549495830 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1549495830 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-1549495830 |ULTIMATE.start_main_#t~ite52_Out-1549495830|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1549495830|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1549495830, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1549495830, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1549495830, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1549495830} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1549495830|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1549495830, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1549495830, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1549495830, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1549495830} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 20:37:23,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x~0_10 2) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_7) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_10} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} 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 20:37:23,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:37:23 BasicIcfg [2019-12-18 20:37:23,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:37:23,264 INFO L168 Benchmark]: Toolchain (without parser) took 193289.76 ms. Allocated memory was 145.8 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 102.2 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 20:37:23,264 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 145.8 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 20:37:23,265 INFO L168 Benchmark]: CACSL2BoogieTranslator took 795.74 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.8 MB in the beginning and 158.3 MB in the end (delta: -56.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-18 20:37:23,265 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.18 ms. Allocated memory is still 203.9 MB. Free memory was 158.3 MB in the beginning and 155.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 20:37:23,265 INFO L168 Benchmark]: Boogie Preprocessor took 37.07 ms. Allocated memory is still 203.9 MB. Free memory was 155.4 MB in the beginning and 153.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 20:37:23,266 INFO L168 Benchmark]: RCFGBuilder took 867.35 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 103.1 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-18 20:37:23,266 INFO L168 Benchmark]: TraceAbstraction took 191515.84 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 103.1 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 20:37:23,268 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.47 ms. Allocated memory is still 145.8 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 795.74 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.8 MB in the beginning and 158.3 MB in the end (delta: -56.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.18 ms. Allocated memory is still 203.9 MB. Free memory was 158.3 MB in the beginning and 155.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.07 ms. Allocated memory is still 203.9 MB. Free memory was 155.4 MB in the beginning and 153.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 867.35 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 103.1 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 191515.84 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 103.1 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 31 ChoiceCompositions, 6457 VarBasedMoverChecksPositive, 198 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84223 CheckedPairsTotal, 112 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(&t497, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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_p1_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=1, 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(&t498, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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=1, 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 = 2 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2, 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] [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_p1_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=2, 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] [L829] FCALL, FORK 0 pthread_create(&t499, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2, 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] [L780] 3 y = 1 [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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=2, y=1, 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=2, y=1, 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=2, y=1, 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=2, y=1, 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)) [L794] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=2, y=1, 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=2, y=1, 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=2, 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] [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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=2, y=1, 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: 191.1s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 106.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10201 SDtfs, 15502 SDslu, 52149 SDs, 0 SdLazy, 67011 SolverSat, 1003 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 56.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1031 GetRequests, 62 SyntacticMatches, 35 SemanticMatches, 934 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18154 ImplicationChecksByTransitivity, 28.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162546occurred 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: 48.8s AutomataMinimizationTime, 37 MinimizatonAttempts, 302145 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 1790 NumberOfCodeBlocks, 1790 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1686 ConstructedInterpolants, 0 QuantifiedInterpolants, 694614 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...