/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix002_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:05:34,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:05:34,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:05:34,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:05:34,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:05:34,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:05:34,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:05:34,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:05:34,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:05:34,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:05:34,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:05:34,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:05:34,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:05:34,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:05:34,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:05:34,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:05:34,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:05:34,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:05:34,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:05:34,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:05:34,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:05:34,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:05:34,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:05:34,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:05:34,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:05:34,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:05:34,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:05:34,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:05:34,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:05:34,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:05:34,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:05:34,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:05:34,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:05:34,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:05:34,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:05:34,763 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:05:34,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:05:34,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:05:34,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:05:34,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:05:34,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:05:34,767 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:05:34,797 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:05:34,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:05:34,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:05:34,804 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:05:34,804 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:05:34,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:05:34,804 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:05:34,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:05:34,805 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:05:34,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:05:34,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:05:34,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:05:34,807 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:05:34,807 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:05:34,808 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:05:34,808 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:05:34,808 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:05:34,808 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:05:34,809 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:05:34,809 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:05:34,809 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:05:34,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:05:34,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:05:34,810 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:05:34,810 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:05:34,810 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:05:34,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:05:34,811 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:05:34,811 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:05:34,811 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:05:35,075 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:05:35,090 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:05:35,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:05:35,096 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:05:35,097 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:05:35,098 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_pso.oepc.i [2019-12-18 12:05:35,171 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6f7b40ff/49f510b752284807886bc02900959bda/FLAGdf3368a95 [2019-12-18 12:05:35,697 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:05:35,698 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_pso.oepc.i [2019-12-18 12:05:35,723 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6f7b40ff/49f510b752284807886bc02900959bda/FLAGdf3368a95 [2019-12-18 12:05:35,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6f7b40ff/49f510b752284807886bc02900959bda [2019-12-18 12:05:35,968 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:05:35,970 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:05:35,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:05:35,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:05:35,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:05:35,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:05:35" (1/1) ... [2019-12-18 12:05:35,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b22db2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:35, skipping insertion in model container [2019-12-18 12:05:35,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:05:35" (1/1) ... [2019-12-18 12:05:35,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:05:36,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:05:36,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:05:36,542 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:05:36,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:05:36,740 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:05:36,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:36 WrapperNode [2019-12-18 12:05:36,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:05:36,742 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:05:36,742 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:05:36,742 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:05:36,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:36" (1/1) ... [2019-12-18 12:05:36,776 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:36" (1/1) ... [2019-12-18 12:05:36,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:05:36,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:05:36,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:05:36,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:05:36,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:36" (1/1) ... [2019-12-18 12:05:36,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:36" (1/1) ... [2019-12-18 12:05:36,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:36" (1/1) ... [2019-12-18 12:05:36,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:36" (1/1) ... [2019-12-18 12:05:36,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:36" (1/1) ... [2019-12-18 12:05:36,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:36" (1/1) ... [2019-12-18 12:05:36,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:36" (1/1) ... [2019-12-18 12:05:36,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:05:36,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:05:36,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:05:36,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:05:36,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:05:36,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:05:36,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:05:36,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:05:36,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:05:36,962 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:05:36,963 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:05:36,963 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:05:36,964 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:05:36,964 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:05:36,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:05:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:05:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:05:36,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:05:36,968 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:05:37,846 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:05:37,847 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:05:37,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:05:37 BoogieIcfgContainer [2019-12-18 12:05:37,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:05:37,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:05:37,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:05:37,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:05:37,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:05:35" (1/3) ... [2019-12-18 12:05:37,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9e444f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:05:37, skipping insertion in model container [2019-12-18 12:05:37,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:05:36" (2/3) ... [2019-12-18 12:05:37,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9e444f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:05:37, skipping insertion in model container [2019-12-18 12:05:37,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:05:37" (3/3) ... [2019-12-18 12:05:37,857 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_pso.oepc.i [2019-12-18 12:05:37,867 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:05:37,868 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:05:37,875 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:05:37,876 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:05:37,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,924 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,925 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,925 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,926 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,926 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,961 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,961 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,969 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,969 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,995 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,995 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:37,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,001 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,003 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,009 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,010 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,010 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:05:38,027 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:05:38,047 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:05:38,048 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:05:38,048 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:05:38,048 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:05:38,048 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:05:38,048 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:05:38,048 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:05:38,049 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:05:38,065 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-18 12:05:38,067 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-18 12:05:38,156 INFO L126 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-18 12:05:38,157 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:05:38,178 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:05:38,207 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-18 12:05:38,254 INFO L126 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-18 12:05:38,254 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:05:38,263 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:05:38,287 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:05:38,288 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:05:43,715 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 12:05:43,867 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 12:05:44,038 INFO L206 etLargeBlockEncoding]: Checked pairs total: 93316 [2019-12-18 12:05:44,039 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 12:05:44,043 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 104 transitions [2019-12-18 12:06:02,754 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-18 12:06:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-18 12:06:02,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:06:02,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:02,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:06:02,764 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:06:02,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:02,771 INFO L82 PathProgramCache]: Analyzing trace with hash 922900, now seen corresponding path program 1 times [2019-12-18 12:06:02,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:02,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500312861] [2019-12-18 12:06:02,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:02,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:02,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500312861] [2019-12-18 12:06:02,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:02,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:06:02,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462030400] [2019-12-18 12:06:02,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:06:02,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:03,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:06:03,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:03,006 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-18 12:06:07,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:07,193 INFO L93 Difference]: Finished difference Result 119349 states and 508327 transitions. [2019-12-18 12:06:07,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:06:07,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:06:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:08,104 INFO L225 Difference]: With dead ends: 119349 [2019-12-18 12:06:08,104 INFO L226 Difference]: Without dead ends: 112420 [2019-12-18 12:06:08,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:12,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112420 states. [2019-12-18 12:06:15,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112420 to 112420. [2019-12-18 12:06:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112420 states. [2019-12-18 12:06:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112420 states to 112420 states and 478219 transitions. [2019-12-18 12:06:16,403 INFO L78 Accepts]: Start accepts. Automaton has 112420 states and 478219 transitions. Word has length 3 [2019-12-18 12:06:16,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:16,403 INFO L462 AbstractCegarLoop]: Abstraction has 112420 states and 478219 transitions. [2019-12-18 12:06:16,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:06:16,404 INFO L276 IsEmpty]: Start isEmpty. Operand 112420 states and 478219 transitions. [2019-12-18 12:06:16,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:06:16,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:16,408 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:06:16,408 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:06:16,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:16,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1739393843, now seen corresponding path program 1 times [2019-12-18 12:06:16,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:16,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771981169] [2019-12-18 12:06:16,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:16,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771981169] [2019-12-18 12:06:16,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:16,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:06:16,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770095754] [2019-12-18 12:06:16,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:06:16,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:16,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:06:16,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:06:16,512 INFO L87 Difference]: Start difference. First operand 112420 states and 478219 transitions. Second operand 4 states. [2019-12-18 12:06:21,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:21,457 INFO L93 Difference]: Finished difference Result 179210 states and 732067 transitions. [2019-12-18 12:06:21,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:06:21,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:06:21,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:22,801 INFO L225 Difference]: With dead ends: 179210 [2019-12-18 12:06:22,801 INFO L226 Difference]: Without dead ends: 179161 [2019-12-18 12:06:22,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:06:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179161 states. [2019-12-18 12:06:36,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179161 to 162301. [2019-12-18 12:06:36,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162301 states. [2019-12-18 12:06:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162301 states to 162301 states and 672031 transitions. [2019-12-18 12:06:37,415 INFO L78 Accepts]: Start accepts. Automaton has 162301 states and 672031 transitions. Word has length 11 [2019-12-18 12:06:37,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:37,415 INFO L462 AbstractCegarLoop]: Abstraction has 162301 states and 672031 transitions. [2019-12-18 12:06:37,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:06:37,416 INFO L276 IsEmpty]: Start isEmpty. Operand 162301 states and 672031 transitions. [2019-12-18 12:06:37,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:06:37,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:37,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:06:37,424 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:06:37,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:37,424 INFO L82 PathProgramCache]: Analyzing trace with hash 53844596, now seen corresponding path program 1 times [2019-12-18 12:06:37,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:37,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404935403] [2019-12-18 12:06:37,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:37,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:37,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404935403] [2019-12-18 12:06:37,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:37,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:06:37,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277026043] [2019-12-18 12:06:37,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:06:37,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:37,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:06:37,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:37,503 INFO L87 Difference]: Start difference. First operand 162301 states and 672031 transitions. Second operand 3 states. [2019-12-18 12:06:37,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:37,629 INFO L93 Difference]: Finished difference Result 34811 states and 113031 transitions. [2019-12-18 12:06:37,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:06:37,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:06:37,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:37,702 INFO L225 Difference]: With dead ends: 34811 [2019-12-18 12:06:37,702 INFO L226 Difference]: Without dead ends: 34811 [2019-12-18 12:06:37,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:37,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34811 states. [2019-12-18 12:06:38,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34811 to 34811. [2019-12-18 12:06:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34811 states. [2019-12-18 12:06:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34811 states to 34811 states and 113031 transitions. [2019-12-18 12:06:38,348 INFO L78 Accepts]: Start accepts. Automaton has 34811 states and 113031 transitions. Word has length 13 [2019-12-18 12:06:38,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:38,349 INFO L462 AbstractCegarLoop]: Abstraction has 34811 states and 113031 transitions. [2019-12-18 12:06:38,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:06:38,349 INFO L276 IsEmpty]: Start isEmpty. Operand 34811 states and 113031 transitions. [2019-12-18 12:06:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:06:38,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:38,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:06:38,352 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:06:38,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:38,353 INFO L82 PathProgramCache]: Analyzing trace with hash -2104175705, now seen corresponding path program 1 times [2019-12-18 12:06:38,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:38,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139670989] [2019-12-18 12:06:38,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:38,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139670989] [2019-12-18 12:06:38,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:38,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:06:38,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154402168] [2019-12-18 12:06:38,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:06:38,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:38,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:06:38,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:06:38,477 INFO L87 Difference]: Start difference. First operand 34811 states and 113031 transitions. Second operand 5 states. [2019-12-18 12:06:41,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:41,361 INFO L93 Difference]: Finished difference Result 48236 states and 154913 transitions. [2019-12-18 12:06:41,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:06:41,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 12:06:41,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:41,432 INFO L225 Difference]: With dead ends: 48236 [2019-12-18 12:06:41,433 INFO L226 Difference]: Without dead ends: 48236 [2019-12-18 12:06:41,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:06:41,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-12-18 12:06:42,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 41215. [2019-12-18 12:06:42,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41215 states. [2019-12-18 12:06:42,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41215 states to 41215 states and 133442 transitions. [2019-12-18 12:06:42,172 INFO L78 Accepts]: Start accepts. Automaton has 41215 states and 133442 transitions. Word has length 16 [2019-12-18 12:06:42,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:42,173 INFO L462 AbstractCegarLoop]: Abstraction has 41215 states and 133442 transitions. [2019-12-18 12:06:42,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:06:42,174 INFO L276 IsEmpty]: Start isEmpty. Operand 41215 states and 133442 transitions. [2019-12-18 12:06:42,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:06:42,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:42,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:06:42,184 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:06:42,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:42,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1566659883, now seen corresponding path program 1 times [2019-12-18 12:06:42,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:42,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027269612] [2019-12-18 12:06:42,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:42,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027269612] [2019-12-18 12:06:42,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:42,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:06:42,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872326176] [2019-12-18 12:06:42,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:06:42,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:42,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:06:42,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:06:42,280 INFO L87 Difference]: Start difference. First operand 41215 states and 133442 transitions. Second operand 6 states. [2019-12-18 12:06:43,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:43,100 INFO L93 Difference]: Finished difference Result 62182 states and 196414 transitions. [2019-12-18 12:06:43,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:06:43,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 12:06:43,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:43,192 INFO L225 Difference]: With dead ends: 62182 [2019-12-18 12:06:43,192 INFO L226 Difference]: Without dead ends: 62175 [2019-12-18 12:06:43,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:06:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62175 states. [2019-12-18 12:06:44,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62175 to 40995. [2019-12-18 12:06:44,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40995 states. [2019-12-18 12:06:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40995 states to 40995 states and 132031 transitions. [2019-12-18 12:06:44,314 INFO L78 Accepts]: Start accepts. Automaton has 40995 states and 132031 transitions. Word has length 22 [2019-12-18 12:06:44,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:44,314 INFO L462 AbstractCegarLoop]: Abstraction has 40995 states and 132031 transitions. [2019-12-18 12:06:44,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:06:44,314 INFO L276 IsEmpty]: Start isEmpty. Operand 40995 states and 132031 transitions. [2019-12-18 12:06:44,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:06:44,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:44,328 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:06:44,328 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:06:44,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:44,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1076429505, now seen corresponding path program 1 times [2019-12-18 12:06:44,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:44,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450928458] [2019-12-18 12:06:44,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:44,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450928458] [2019-12-18 12:06:44,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:44,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:06:44,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578232698] [2019-12-18 12:06:44,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:06:44,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:44,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:06:44,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:06:44,392 INFO L87 Difference]: Start difference. First operand 40995 states and 132031 transitions. Second operand 4 states. [2019-12-18 12:06:44,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:44,465 INFO L93 Difference]: Finished difference Result 16196 states and 49196 transitions. [2019-12-18 12:06:44,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:06:44,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:06:44,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:44,485 INFO L225 Difference]: With dead ends: 16196 [2019-12-18 12:06:44,486 INFO L226 Difference]: Without dead ends: 16196 [2019-12-18 12:06:44,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:06:44,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16196 states. [2019-12-18 12:06:44,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16196 to 15833. [2019-12-18 12:06:44,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15833 states. [2019-12-18 12:06:44,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15833 states to 15833 states and 48160 transitions. [2019-12-18 12:06:44,709 INFO L78 Accepts]: Start accepts. Automaton has 15833 states and 48160 transitions. Word has length 25 [2019-12-18 12:06:44,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:44,710 INFO L462 AbstractCegarLoop]: Abstraction has 15833 states and 48160 transitions. [2019-12-18 12:06:44,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:06:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand 15833 states and 48160 transitions. [2019-12-18 12:06:44,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:06:44,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:44,721 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 12:06:44,722 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:06:44,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:44,722 INFO L82 PathProgramCache]: Analyzing trace with hash -877586735, now seen corresponding path program 1 times [2019-12-18 12:06:44,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:44,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779147725] [2019-12-18 12:06:44,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:44,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:44,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779147725] [2019-12-18 12:06:44,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:44,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:06:44,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466553467] [2019-12-18 12:06:44,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:06:44,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:44,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:06:44,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:44,778 INFO L87 Difference]: Start difference. First operand 15833 states and 48160 transitions. Second operand 3 states. [2019-12-18 12:06:44,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:44,872 INFO L93 Difference]: Finished difference Result 23073 states and 68792 transitions. [2019-12-18 12:06:44,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:06:44,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:06:44,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:44,901 INFO L225 Difference]: With dead ends: 23073 [2019-12-18 12:06:44,901 INFO L226 Difference]: Without dead ends: 23073 [2019-12-18 12:06:44,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:44,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23073 states. [2019-12-18 12:06:45,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23073 to 17600. [2019-12-18 12:06:45,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17600 states. [2019-12-18 12:06:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17600 states to 17600 states and 53010 transitions. [2019-12-18 12:06:45,179 INFO L78 Accepts]: Start accepts. Automaton has 17600 states and 53010 transitions. Word has length 27 [2019-12-18 12:06:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:45,180 INFO L462 AbstractCegarLoop]: Abstraction has 17600 states and 53010 transitions. [2019-12-18 12:06:45,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:06:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 17600 states and 53010 transitions. [2019-12-18 12:06:45,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:06:45,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:45,192 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 12:06:45,192 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:06:45,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:45,192 INFO L82 PathProgramCache]: Analyzing trace with hash -603523497, now seen corresponding path program 1 times [2019-12-18 12:06:45,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:45,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536706896] [2019-12-18 12:06:45,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:45,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536706896] [2019-12-18 12:06:45,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:45,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:06:45,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13960371] [2019-12-18 12:06:45,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:06:45,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:45,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:06:45,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:06:45,293 INFO L87 Difference]: Start difference. First operand 17600 states and 53010 transitions. Second operand 6 states. [2019-12-18 12:06:45,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:45,794 INFO L93 Difference]: Finished difference Result 24767 states and 72789 transitions. [2019-12-18 12:06:45,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:06:45,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:06:45,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:45,831 INFO L225 Difference]: With dead ends: 24767 [2019-12-18 12:06:45,831 INFO L226 Difference]: Without dead ends: 24767 [2019-12-18 12:06:45,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:06:46,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24767 states. [2019-12-18 12:06:46,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24767 to 20286. [2019-12-18 12:06:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20286 states. [2019-12-18 12:06:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20286 states to 20286 states and 60759 transitions. [2019-12-18 12:06:46,271 INFO L78 Accepts]: Start accepts. Automaton has 20286 states and 60759 transitions. Word has length 27 [2019-12-18 12:06:46,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:46,271 INFO L462 AbstractCegarLoop]: Abstraction has 20286 states and 60759 transitions. [2019-12-18 12:06:46,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:06:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 20286 states and 60759 transitions. [2019-12-18 12:06:46,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:06:46,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:46,292 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 12:06:46,292 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:06:46,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:46,293 INFO L82 PathProgramCache]: Analyzing trace with hash 94968403, now seen corresponding path program 1 times [2019-12-18 12:06:46,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:46,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79599914] [2019-12-18 12:06:46,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:46,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 12:06:46,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79599914] [2019-12-18 12:06:46,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:46,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:06:46,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194220637] [2019-12-18 12:06:46,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:06:46,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:46,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:06:46,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:06:46,412 INFO L87 Difference]: Start difference. First operand 20286 states and 60759 transitions. Second operand 7 states. [2019-12-18 12:06:47,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:47,623 INFO L93 Difference]: Finished difference Result 27601 states and 80773 transitions. [2019-12-18 12:06:47,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:06:47,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 12:06:47,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:47,659 INFO L225 Difference]: With dead ends: 27601 [2019-12-18 12:06:47,659 INFO L226 Difference]: Without dead ends: 27601 [2019-12-18 12:06:47,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:06:47,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27601 states. [2019-12-18 12:06:47,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27601 to 18412. [2019-12-18 12:06:47,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18412 states. [2019-12-18 12:06:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18412 states to 18412 states and 55362 transitions. [2019-12-18 12:06:47,966 INFO L78 Accepts]: Start accepts. Automaton has 18412 states and 55362 transitions. Word has length 33 [2019-12-18 12:06:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:47,967 INFO L462 AbstractCegarLoop]: Abstraction has 18412 states and 55362 transitions. [2019-12-18 12:06:47,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:06:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand 18412 states and 55362 transitions. [2019-12-18 12:06:47,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:06:47,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:47,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:06:47,989 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:06:47,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:47,990 INFO L82 PathProgramCache]: Analyzing trace with hash 994852703, now seen corresponding path program 1 times [2019-12-18 12:06:47,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:47,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488307349] [2019-12-18 12:06:47,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:48,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488307349] [2019-12-18 12:06:48,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:48,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:06:48,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526276522] [2019-12-18 12:06:48,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:06:48,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:48,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:06:48,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:48,043 INFO L87 Difference]: Start difference. First operand 18412 states and 55362 transitions. Second operand 3 states. [2019-12-18 12:06:48,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:48,111 INFO L93 Difference]: Finished difference Result 18411 states and 55360 transitions. [2019-12-18 12:06:48,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:06:48,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:06:48,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:48,145 INFO L225 Difference]: With dead ends: 18411 [2019-12-18 12:06:48,145 INFO L226 Difference]: Without dead ends: 18411 [2019-12-18 12:06:48,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:48,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2019-12-18 12:06:48,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 18411. [2019-12-18 12:06:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18411 states. [2019-12-18 12:06:48,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18411 states to 18411 states and 55360 transitions. [2019-12-18 12:06:48,542 INFO L78 Accepts]: Start accepts. Automaton has 18411 states and 55360 transitions. Word has length 39 [2019-12-18 12:06:48,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:48,543 INFO L462 AbstractCegarLoop]: Abstraction has 18411 states and 55360 transitions. [2019-12-18 12:06:48,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:06:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 18411 states and 55360 transitions. [2019-12-18 12:06:48,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:06:48,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:48,566 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:06:48,566 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:06:48,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:48,567 INFO L82 PathProgramCache]: Analyzing trace with hash 467911076, now seen corresponding path program 1 times [2019-12-18 12:06:48,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:48,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729174760] [2019-12-18 12:06:48,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:48,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729174760] [2019-12-18 12:06:48,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:48,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:06:48,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616148627] [2019-12-18 12:06:48,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:06:48,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:48,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:06:48,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:48,678 INFO L87 Difference]: Start difference. First operand 18411 states and 55360 transitions. Second operand 3 states. [2019-12-18 12:06:48,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:48,740 INFO L93 Difference]: Finished difference Result 18325 states and 55099 transitions. [2019-12-18 12:06:48,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:06:48,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 12:06:48,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:48,764 INFO L225 Difference]: With dead ends: 18325 [2019-12-18 12:06:48,765 INFO L226 Difference]: Without dead ends: 18325 [2019-12-18 12:06:48,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18325 states. [2019-12-18 12:06:49,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18325 to 16323. [2019-12-18 12:06:49,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16323 states. [2019-12-18 12:06:49,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16323 states to 16323 states and 49617 transitions. [2019-12-18 12:06:49,111 INFO L78 Accepts]: Start accepts. Automaton has 16323 states and 49617 transitions. Word has length 40 [2019-12-18 12:06:49,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:49,111 INFO L462 AbstractCegarLoop]: Abstraction has 16323 states and 49617 transitions. [2019-12-18 12:06:49,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:06:49,111 INFO L276 IsEmpty]: Start isEmpty. Operand 16323 states and 49617 transitions. [2019-12-18 12:06:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 12:06:49,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:49,127 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 12:06:49,128 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:06:49,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:49,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1873584483, now seen corresponding path program 1 times [2019-12-18 12:06:49,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:49,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136616699] [2019-12-18 12:06:49,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:49,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:49,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136616699] [2019-12-18 12:06:49,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:49,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:06:49,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383902965] [2019-12-18 12:06:49,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:06:49,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:49,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:06:49,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:06:49,190 INFO L87 Difference]: Start difference. First operand 16323 states and 49617 transitions. Second operand 5 states. [2019-12-18 12:06:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:49,270 INFO L93 Difference]: Finished difference Result 15143 states and 47024 transitions. [2019-12-18 12:06:49,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:06:49,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 12:06:49,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:49,297 INFO L225 Difference]: With dead ends: 15143 [2019-12-18 12:06:49,297 INFO L226 Difference]: Without dead ends: 15143 [2019-12-18 12:06:49,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:06:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15143 states. [2019-12-18 12:06:49,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15143 to 15143. [2019-12-18 12:06:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15143 states. [2019-12-18 12:06:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15143 states to 15143 states and 47024 transitions. [2019-12-18 12:06:49,525 INFO L78 Accepts]: Start accepts. Automaton has 15143 states and 47024 transitions. Word has length 41 [2019-12-18 12:06:49,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:49,525 INFO L462 AbstractCegarLoop]: Abstraction has 15143 states and 47024 transitions. [2019-12-18 12:06:49,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:06:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 15143 states and 47024 transitions. [2019-12-18 12:06:49,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:06:49,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:49,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:06:49,541 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:06:49,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:49,542 INFO L82 PathProgramCache]: Analyzing trace with hash 628999064, now seen corresponding path program 1 times [2019-12-18 12:06:49,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:49,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345845828] [2019-12-18 12:06:49,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:49,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345845828] [2019-12-18 12:06:49,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:49,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:06:49,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169679116] [2019-12-18 12:06:49,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:06:49,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:49,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:06:49,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:49,589 INFO L87 Difference]: Start difference. First operand 15143 states and 47024 transitions. Second operand 3 states. [2019-12-18 12:06:49,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:49,686 INFO L93 Difference]: Finished difference Result 19655 states and 59985 transitions. [2019-12-18 12:06:49,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:06:49,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:06:49,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:49,718 INFO L225 Difference]: With dead ends: 19655 [2019-12-18 12:06:49,718 INFO L226 Difference]: Without dead ends: 19655 [2019-12-18 12:06:49,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:49,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19655 states. [2019-12-18 12:06:50,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19655 to 14961. [2019-12-18 12:06:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14961 states. [2019-12-18 12:06:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14961 states to 14961 states and 45870 transitions. [2019-12-18 12:06:50,042 INFO L78 Accepts]: Start accepts. Automaton has 14961 states and 45870 transitions. Word has length 65 [2019-12-18 12:06:50,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:50,042 INFO L462 AbstractCegarLoop]: Abstraction has 14961 states and 45870 transitions. [2019-12-18 12:06:50,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:06:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 14961 states and 45870 transitions. [2019-12-18 12:06:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:06:50,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:50,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:06:50,063 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:06:50,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:50,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1958678932, now seen corresponding path program 1 times [2019-12-18 12:06:50,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:50,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116667954] [2019-12-18 12:06:50,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:50,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:50,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116667954] [2019-12-18 12:06:50,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:50,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:06:50,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035309272] [2019-12-18 12:06:50,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:06:50,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:50,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:06:50,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:06:50,160 INFO L87 Difference]: Start difference. First operand 14961 states and 45870 transitions. Second operand 7 states. [2019-12-18 12:06:50,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:50,629 INFO L93 Difference]: Finished difference Result 43069 states and 131367 transitions. [2019-12-18 12:06:50,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:06:50,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:06:50,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:50,672 INFO L225 Difference]: With dead ends: 43069 [2019-12-18 12:06:50,672 INFO L226 Difference]: Without dead ends: 33469 [2019-12-18 12:06:50,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:06:50,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33469 states. [2019-12-18 12:06:51,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33469 to 18596. [2019-12-18 12:06:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18596 states. [2019-12-18 12:06:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18596 states to 18596 states and 57138 transitions. [2019-12-18 12:06:51,039 INFO L78 Accepts]: Start accepts. Automaton has 18596 states and 57138 transitions. Word has length 65 [2019-12-18 12:06:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:51,039 INFO L462 AbstractCegarLoop]: Abstraction has 18596 states and 57138 transitions. [2019-12-18 12:06:51,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:06:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 18596 states and 57138 transitions. [2019-12-18 12:06:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:06:51,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:51,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:06:51,063 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:06:51,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:51,063 INFO L82 PathProgramCache]: Analyzing trace with hash -29541862, now seen corresponding path program 2 times [2019-12-18 12:06:51,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:51,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511469027] [2019-12-18 12:06:51,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:51,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511469027] [2019-12-18 12:06:51,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:51,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:06:51,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833872952] [2019-12-18 12:06:51,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:06:51,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:51,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:06:51,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:06:51,146 INFO L87 Difference]: Start difference. First operand 18596 states and 57138 transitions. Second operand 7 states. [2019-12-18 12:06:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:51,669 INFO L93 Difference]: Finished difference Result 48601 states and 146797 transitions. [2019-12-18 12:06:51,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:06:51,669 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:06:51,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:51,727 INFO L225 Difference]: With dead ends: 48601 [2019-12-18 12:06:51,728 INFO L226 Difference]: Without dead ends: 35759 [2019-12-18 12:06:51,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:06:51,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35759 states. [2019-12-18 12:06:52,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35759 to 21981. [2019-12-18 12:06:52,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21981 states. [2019-12-18 12:06:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21981 states to 21981 states and 67224 transitions. [2019-12-18 12:06:52,140 INFO L78 Accepts]: Start accepts. Automaton has 21981 states and 67224 transitions. Word has length 65 [2019-12-18 12:06:52,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:52,140 INFO L462 AbstractCegarLoop]: Abstraction has 21981 states and 67224 transitions. [2019-12-18 12:06:52,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:06:52,141 INFO L276 IsEmpty]: Start isEmpty. Operand 21981 states and 67224 transitions. [2019-12-18 12:06:52,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:06:52,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:52,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:06:52,164 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:06:52,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:52,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1604322860, now seen corresponding path program 3 times [2019-12-18 12:06:52,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:52,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720142710] [2019-12-18 12:06:52,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:52,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720142710] [2019-12-18 12:06:52,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:52,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:06:52,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883729329] [2019-12-18 12:06:52,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:06:52,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:52,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:06:52,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:06:52,289 INFO L87 Difference]: Start difference. First operand 21981 states and 67224 transitions. Second operand 9 states. [2019-12-18 12:06:53,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:53,641 INFO L93 Difference]: Finished difference Result 65932 states and 199427 transitions. [2019-12-18 12:06:53,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:06:53,641 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:06:53,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:53,729 INFO L225 Difference]: With dead ends: 65932 [2019-12-18 12:06:53,729 INFO L226 Difference]: Without dead ends: 63310 [2019-12-18 12:06:53,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:06:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63310 states. [2019-12-18 12:06:54,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63310 to 22137. [2019-12-18 12:06:54,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22137 states. [2019-12-18 12:06:54,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22137 states to 22137 states and 67886 transitions. [2019-12-18 12:06:54,557 INFO L78 Accepts]: Start accepts. Automaton has 22137 states and 67886 transitions. Word has length 65 [2019-12-18 12:06:54,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:54,557 INFO L462 AbstractCegarLoop]: Abstraction has 22137 states and 67886 transitions. [2019-12-18 12:06:54,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:06:54,557 INFO L276 IsEmpty]: Start isEmpty. Operand 22137 states and 67886 transitions. [2019-12-18 12:06:54,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:06:54,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:54,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:06:54,579 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:06:54,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:54,579 INFO L82 PathProgramCache]: Analyzing trace with hash -2017880016, now seen corresponding path program 4 times [2019-12-18 12:06:54,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:54,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585693242] [2019-12-18 12:06:54,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:54,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585693242] [2019-12-18 12:06:54,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:54,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:06:54,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848004636] [2019-12-18 12:06:54,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:06:54,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:54,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:06:54,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:06:54,721 INFO L87 Difference]: Start difference. First operand 22137 states and 67886 transitions. Second operand 9 states. [2019-12-18 12:06:55,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:55,986 INFO L93 Difference]: Finished difference Result 78329 states and 236465 transitions. [2019-12-18 12:06:55,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:06:55,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:06:55,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:56,098 INFO L225 Difference]: With dead ends: 78329 [2019-12-18 12:06:56,098 INFO L226 Difference]: Without dead ends: 75771 [2019-12-18 12:06:56,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:06:56,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75771 states. [2019-12-18 12:06:56,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75771 to 22174. [2019-12-18 12:06:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22174 states. [2019-12-18 12:06:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22174 states to 22174 states and 68084 transitions. [2019-12-18 12:06:56,826 INFO L78 Accepts]: Start accepts. Automaton has 22174 states and 68084 transitions. Word has length 65 [2019-12-18 12:06:56,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:56,826 INFO L462 AbstractCegarLoop]: Abstraction has 22174 states and 68084 transitions. [2019-12-18 12:06:56,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:06:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 22174 states and 68084 transitions. [2019-12-18 12:06:56,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:06:56,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:56,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:06:56,849 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:06:56,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:56,850 INFO L82 PathProgramCache]: Analyzing trace with hash -841108452, now seen corresponding path program 5 times [2019-12-18 12:06:56,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:56,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734238322] [2019-12-18 12:06:56,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:56,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734238322] [2019-12-18 12:06:56,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:56,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:06:56,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746699881] [2019-12-18 12:06:56,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:06:56,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:56,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:06:56,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:56,921 INFO L87 Difference]: Start difference. First operand 22174 states and 68084 transitions. Second operand 3 states. [2019-12-18 12:06:57,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:57,044 INFO L93 Difference]: Finished difference Result 25241 states and 77567 transitions. [2019-12-18 12:06:57,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:06:57,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:06:57,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:57,081 INFO L225 Difference]: With dead ends: 25241 [2019-12-18 12:06:57,081 INFO L226 Difference]: Without dead ends: 25241 [2019-12-18 12:06:57,081 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 12:06:57,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25241 states. [2019-12-18 12:06:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25241 to 21050. [2019-12-18 12:06:57,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21050 states. [2019-12-18 12:06:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21050 states to 21050 states and 65371 transitions. [2019-12-18 12:06:57,609 INFO L78 Accepts]: Start accepts. Automaton has 21050 states and 65371 transitions. Word has length 65 [2019-12-18 12:06:57,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:57,609 INFO L462 AbstractCegarLoop]: Abstraction has 21050 states and 65371 transitions. [2019-12-18 12:06:57,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:06:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand 21050 states and 65371 transitions. [2019-12-18 12:06:57,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:06:57,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:57,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:06:57,630 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:06:57,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:57,630 INFO L82 PathProgramCache]: Analyzing trace with hash -23971085, now seen corresponding path program 1 times [2019-12-18 12:06:57,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:57,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826035120] [2019-12-18 12:06:57,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:57,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826035120] [2019-12-18 12:06:57,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:57,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:06:57,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237648344] [2019-12-18 12:06:57,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:06:57,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:57,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:06:57,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:06:57,729 INFO L87 Difference]: Start difference. First operand 21050 states and 65371 transitions. Second operand 8 states. [2019-12-18 12:06:58,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:58,627 INFO L93 Difference]: Finished difference Result 52001 states and 158465 transitions. [2019-12-18 12:06:58,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:06:58,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 12:06:58,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:58,688 INFO L225 Difference]: With dead ends: 52001 [2019-12-18 12:06:58,689 INFO L226 Difference]: Without dead ends: 48845 [2019-12-18 12:06:58,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:06:58,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48845 states. [2019-12-18 12:06:59,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48845 to 21134. [2019-12-18 12:06:59,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21134 states. [2019-12-18 12:06:59,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21134 states to 21134 states and 65711 transitions. [2019-12-18 12:06:59,174 INFO L78 Accepts]: Start accepts. Automaton has 21134 states and 65711 transitions. Word has length 66 [2019-12-18 12:06:59,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:59,175 INFO L462 AbstractCegarLoop]: Abstraction has 21134 states and 65711 transitions. [2019-12-18 12:06:59,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:06:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 21134 states and 65711 transitions. [2019-12-18 12:06:59,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:06:59,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:59,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:06:59,199 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:06:59,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:59,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1713623309, now seen corresponding path program 2 times [2019-12-18 12:06:59,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:59,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240528507] [2019-12-18 12:06:59,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:59,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240528507] [2019-12-18 12:06:59,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:59,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:06:59,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763995056] [2019-12-18 12:06:59,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:06:59,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:59,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:06:59,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:06:59,319 INFO L87 Difference]: Start difference. First operand 21134 states and 65711 transitions. Second operand 9 states. [2019-12-18 12:07:00,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:00,642 INFO L93 Difference]: Finished difference Result 59225 states and 178920 transitions. [2019-12-18 12:07:00,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:07:00,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:07:00,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:00,722 INFO L225 Difference]: With dead ends: 59225 [2019-12-18 12:07:00,722 INFO L226 Difference]: Without dead ends: 56069 [2019-12-18 12:07:00,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:07:00,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56069 states. [2019-12-18 12:07:01,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56069 to 21156. [2019-12-18 12:07:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21156 states. [2019-12-18 12:07:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21156 states to 21156 states and 65782 transitions. [2019-12-18 12:07:01,483 INFO L78 Accepts]: Start accepts. Automaton has 21156 states and 65782 transitions. Word has length 66 [2019-12-18 12:07:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:01,484 INFO L462 AbstractCegarLoop]: Abstraction has 21156 states and 65782 transitions. [2019-12-18 12:07:01,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:07:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 21156 states and 65782 transitions. [2019-12-18 12:07:01,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:07:01,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:01,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:07:01,510 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:01,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:01,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1583227917, now seen corresponding path program 3 times [2019-12-18 12:07:01,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:01,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813738134] [2019-12-18 12:07:01,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:01,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:01,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813738134] [2019-12-18 12:07:01,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:01,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:07:01,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060802413] [2019-12-18 12:07:01,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:07:01,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:01,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:07:01,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:07:01,626 INFO L87 Difference]: Start difference. First operand 21156 states and 65782 transitions. Second operand 9 states. [2019-12-18 12:07:02,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:02,948 INFO L93 Difference]: Finished difference Result 65701 states and 198070 transitions. [2019-12-18 12:07:02,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:07:02,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:07:02,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:03,036 INFO L225 Difference]: With dead ends: 65701 [2019-12-18 12:07:03,036 INFO L226 Difference]: Without dead ends: 62568 [2019-12-18 12:07:03,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:07:03,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62568 states. [2019-12-18 12:07:03,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62568 to 21037. [2019-12-18 12:07:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21037 states. [2019-12-18 12:07:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21037 states to 21037 states and 65199 transitions. [2019-12-18 12:07:03,641 INFO L78 Accepts]: Start accepts. Automaton has 21037 states and 65199 transitions. Word has length 66 [2019-12-18 12:07:03,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:03,641 INFO L462 AbstractCegarLoop]: Abstraction has 21037 states and 65199 transitions. [2019-12-18 12:07:03,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:07:03,641 INFO L276 IsEmpty]: Start isEmpty. Operand 21037 states and 65199 transitions. [2019-12-18 12:07:03,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:07:03,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:03,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:07:03,665 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:03,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:03,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1805047887, now seen corresponding path program 4 times [2019-12-18 12:07:03,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:03,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153215376] [2019-12-18 12:07:03,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:03,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:03,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153215376] [2019-12-18 12:07:03,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:03,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:07:03,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433148204] [2019-12-18 12:07:03,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:07:03,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:03,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:07:03,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:07:03,788 INFO L87 Difference]: Start difference. First operand 21037 states and 65199 transitions. Second operand 7 states. [2019-12-18 12:07:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:04,569 INFO L93 Difference]: Finished difference Result 33222 states and 101569 transitions. [2019-12-18 12:07:04,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 12:07:04,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 12:07:04,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:04,614 INFO L225 Difference]: With dead ends: 33222 [2019-12-18 12:07:04,615 INFO L226 Difference]: Without dead ends: 33222 [2019-12-18 12:07:04,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:07:04,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33222 states. [2019-12-18 12:07:04,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33222 to 20376. [2019-12-18 12:07:04,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20376 states. [2019-12-18 12:07:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20376 states to 20376 states and 62283 transitions. [2019-12-18 12:07:04,987 INFO L78 Accepts]: Start accepts. Automaton has 20376 states and 62283 transitions. Word has length 66 [2019-12-18 12:07:04,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:04,987 INFO L462 AbstractCegarLoop]: Abstraction has 20376 states and 62283 transitions. [2019-12-18 12:07:04,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:07:04,987 INFO L276 IsEmpty]: Start isEmpty. Operand 20376 states and 62283 transitions. [2019-12-18 12:07:05,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:07:05,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:05,009 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:07:05,009 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:05,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:05,010 INFO L82 PathProgramCache]: Analyzing trace with hash -707932787, now seen corresponding path program 1 times [2019-12-18 12:07:05,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:05,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429070823] [2019-12-18 12:07:05,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:05,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429070823] [2019-12-18 12:07:05,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:05,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:07:05,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228897103] [2019-12-18 12:07:05,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:07:05,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:05,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:07:05,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:07:05,268 INFO L87 Difference]: Start difference. First operand 20376 states and 62283 transitions. Second operand 4 states. [2019-12-18 12:07:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:05,385 INFO L93 Difference]: Finished difference Result 20191 states and 61547 transitions. [2019-12-18 12:07:05,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:07:05,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 12:07:05,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:05,411 INFO L225 Difference]: With dead ends: 20191 [2019-12-18 12:07:05,411 INFO L226 Difference]: Without dead ends: 20191 [2019-12-18 12:07:05,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:07:05,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20191 states. [2019-12-18 12:07:05,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20191 to 18496. [2019-12-18 12:07:05,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18496 states. [2019-12-18 12:07:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18496 states to 18496 states and 56455 transitions. [2019-12-18 12:07:05,697 INFO L78 Accepts]: Start accepts. Automaton has 18496 states and 56455 transitions. Word has length 66 [2019-12-18 12:07:05,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:05,698 INFO L462 AbstractCegarLoop]: Abstraction has 18496 states and 56455 transitions. [2019-12-18 12:07:05,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:07:05,698 INFO L276 IsEmpty]: Start isEmpty. Operand 18496 states and 56455 transitions. [2019-12-18 12:07:05,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:07:05,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:05,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:07:05,718 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:05,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:05,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1506873112, now seen corresponding path program 1 times [2019-12-18 12:07:05,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:05,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467246446] [2019-12-18 12:07:05,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:05,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467246446] [2019-12-18 12:07:05,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:05,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:07:05,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823377939] [2019-12-18 12:07:05,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:07:05,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:05,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:07:05,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:05,782 INFO L87 Difference]: Start difference. First operand 18496 states and 56455 transitions. Second operand 3 states. [2019-12-18 12:07:05,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:05,854 INFO L93 Difference]: Finished difference Result 16117 states and 48226 transitions. [2019-12-18 12:07:05,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:07:05,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:07:05,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:05,887 INFO L225 Difference]: With dead ends: 16117 [2019-12-18 12:07:05,887 INFO L226 Difference]: Without dead ends: 16117 [2019-12-18 12:07:05,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16117 states. [2019-12-18 12:07:06,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16117 to 14647. [2019-12-18 12:07:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14647 states. [2019-12-18 12:07:06,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14647 states to 14647 states and 43816 transitions. [2019-12-18 12:07:06,286 INFO L78 Accepts]: Start accepts. Automaton has 14647 states and 43816 transitions. Word has length 66 [2019-12-18 12:07:06,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:06,286 INFO L462 AbstractCegarLoop]: Abstraction has 14647 states and 43816 transitions. [2019-12-18 12:07:06,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:07:06,286 INFO L276 IsEmpty]: Start isEmpty. Operand 14647 states and 43816 transitions. [2019-12-18 12:07:06,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:07:06,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:06,309 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 12:07:06,310 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:06,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:06,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1717710349, now seen corresponding path program 1 times [2019-12-18 12:07:06,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:06,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797191047] [2019-12-18 12:07:06,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:06,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797191047] [2019-12-18 12:07:06,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:06,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:07:06,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176406083] [2019-12-18 12:07:06,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:07:06,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:06,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:07:06,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:07:06,422 INFO L87 Difference]: Start difference. First operand 14647 states and 43816 transitions. Second operand 9 states. [2019-12-18 12:07:07,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:07,796 INFO L93 Difference]: Finished difference Result 28454 states and 84160 transitions. [2019-12-18 12:07:07,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:07:07,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 12:07:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:07,827 INFO L225 Difference]: With dead ends: 28454 [2019-12-18 12:07:07,827 INFO L226 Difference]: Without dead ends: 23657 [2019-12-18 12:07:07,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:07:07,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23657 states. [2019-12-18 12:07:08,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23657 to 15071. [2019-12-18 12:07:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15071 states. [2019-12-18 12:07:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15071 states to 15071 states and 44798 transitions. [2019-12-18 12:07:08,125 INFO L78 Accepts]: Start accepts. Automaton has 15071 states and 44798 transitions. Word has length 67 [2019-12-18 12:07:08,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:08,125 INFO L462 AbstractCegarLoop]: Abstraction has 15071 states and 44798 transitions. [2019-12-18 12:07:08,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:07:08,125 INFO L276 IsEmpty]: Start isEmpty. Operand 15071 states and 44798 transitions. [2019-12-18 12:07:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:07:08,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:08,141 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 12:07:08,141 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:08,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:08,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1715738515, now seen corresponding path program 2 times [2019-12-18 12:07:08,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:08,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645154308] [2019-12-18 12:07:08,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:08,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645154308] [2019-12-18 12:07:08,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:08,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 12:07:08,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286296414] [2019-12-18 12:07:08,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 12:07:08,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:08,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 12:07:08,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:07:08,762 INFO L87 Difference]: Start difference. First operand 15071 states and 44798 transitions. Second operand 20 states. [2019-12-18 12:07:14,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:14,702 INFO L93 Difference]: Finished difference Result 19374 states and 56792 transitions. [2019-12-18 12:07:14,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-12-18 12:07:14,702 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-18 12:07:14,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:14,723 INFO L225 Difference]: With dead ends: 19374 [2019-12-18 12:07:14,723 INFO L226 Difference]: Without dead ends: 16155 [2019-12-18 12:07:14,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=544, Invalid=4012, Unknown=0, NotChecked=0, Total=4556 [2019-12-18 12:07:14,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16155 states. [2019-12-18 12:07:14,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16155 to 15301. [2019-12-18 12:07:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15301 states. [2019-12-18 12:07:14,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15301 states to 15301 states and 45396 transitions. [2019-12-18 12:07:14,945 INFO L78 Accepts]: Start accepts. Automaton has 15301 states and 45396 transitions. Word has length 67 [2019-12-18 12:07:14,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:14,945 INFO L462 AbstractCegarLoop]: Abstraction has 15301 states and 45396 transitions. [2019-12-18 12:07:14,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 12:07:14,945 INFO L276 IsEmpty]: Start isEmpty. Operand 15301 states and 45396 transitions. [2019-12-18 12:07:14,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:07:14,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:14,959 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 12:07:14,960 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:14,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:14,960 INFO L82 PathProgramCache]: Analyzing trace with hash -2010664093, now seen corresponding path program 3 times [2019-12-18 12:07:14,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:14,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901804420] [2019-12-18 12:07:14,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:15,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901804420] [2019-12-18 12:07:15,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:15,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:07:15,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776216717] [2019-12-18 12:07:15,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:07:15,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:15,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:07:15,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:07:15,131 INFO L87 Difference]: Start difference. First operand 15301 states and 45396 transitions. Second operand 11 states. [2019-12-18 12:07:16,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:16,443 INFO L93 Difference]: Finished difference Result 19908 states and 58548 transitions. [2019-12-18 12:07:16,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:07:16,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:07:16,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:16,469 INFO L225 Difference]: With dead ends: 19908 [2019-12-18 12:07:16,469 INFO L226 Difference]: Without dead ends: 18140 [2019-12-18 12:07:16,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:07:16,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18140 states. [2019-12-18 12:07:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18140 to 15164. [2019-12-18 12:07:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15164 states. [2019-12-18 12:07:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15164 states to 15164 states and 45029 transitions. [2019-12-18 12:07:16,711 INFO L78 Accepts]: Start accepts. Automaton has 15164 states and 45029 transitions. Word has length 67 [2019-12-18 12:07:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:16,712 INFO L462 AbstractCegarLoop]: Abstraction has 15164 states and 45029 transitions. [2019-12-18 12:07:16,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:07:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 15164 states and 45029 transitions. [2019-12-18 12:07:16,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:07:16,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:16,727 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 12:07:16,727 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:16,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:16,727 INFO L82 PathProgramCache]: Analyzing trace with hash -809344243, now seen corresponding path program 4 times [2019-12-18 12:07:16,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:16,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601138648] [2019-12-18 12:07:16,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:17,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601138648] [2019-12-18 12:07:17,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:17,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 12:07:17,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637912725] [2019-12-18 12:07:17,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 12:07:17,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:17,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 12:07:17,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:07:17,367 INFO L87 Difference]: Start difference. First operand 15164 states and 45029 transitions. Second operand 20 states. [2019-12-18 12:07:23,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:23,901 INFO L93 Difference]: Finished difference Result 22639 states and 67163 transitions. [2019-12-18 12:07:23,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-18 12:07:23,901 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-18 12:07:23,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:23,929 INFO L225 Difference]: With dead ends: 22639 [2019-12-18 12:07:23,929 INFO L226 Difference]: Without dead ends: 20807 [2019-12-18 12:07:23,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=475, Invalid=3307, Unknown=0, NotChecked=0, Total=3782 [2019-12-18 12:07:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20807 states. [2019-12-18 12:07:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20807 to 15915. [2019-12-18 12:07:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15915 states. [2019-12-18 12:07:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15915 states to 15915 states and 47099 transitions. [2019-12-18 12:07:24,197 INFO L78 Accepts]: Start accepts. Automaton has 15915 states and 47099 transitions. Word has length 67 [2019-12-18 12:07:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:24,197 INFO L462 AbstractCegarLoop]: Abstraction has 15915 states and 47099 transitions. [2019-12-18 12:07:24,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 12:07:24,197 INFO L276 IsEmpty]: Start isEmpty. Operand 15915 states and 47099 transitions. [2019-12-18 12:07:24,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:07:24,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:24,213 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 12:07:24,213 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:24,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:24,213 INFO L82 PathProgramCache]: Analyzing trace with hash -351875605, now seen corresponding path program 5 times [2019-12-18 12:07:24,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:24,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548768916] [2019-12-18 12:07:24,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:24,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:24,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548768916] [2019-12-18 12:07:24,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:24,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 12:07:24,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343310139] [2019-12-18 12:07:24,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 12:07:24,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:24,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 12:07:24,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:07:24,828 INFO L87 Difference]: Start difference. First operand 15915 states and 47099 transitions. Second operand 20 states. [2019-12-18 12:07:31,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:31,496 INFO L93 Difference]: Finished difference Result 22444 states and 66586 transitions. [2019-12-18 12:07:31,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 12:07:31,497 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-18 12:07:31,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:31,525 INFO L225 Difference]: With dead ends: 22444 [2019-12-18 12:07:31,525 INFO L226 Difference]: Without dead ends: 21845 [2019-12-18 12:07:31,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=398, Invalid=2794, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 12:07:31,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21845 states. [2019-12-18 12:07:31,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21845 to 16299. [2019-12-18 12:07:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16299 states. [2019-12-18 12:07:31,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16299 states to 16299 states and 48103 transitions. [2019-12-18 12:07:31,804 INFO L78 Accepts]: Start accepts. Automaton has 16299 states and 48103 transitions. Word has length 67 [2019-12-18 12:07:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:31,804 INFO L462 AbstractCegarLoop]: Abstraction has 16299 states and 48103 transitions. [2019-12-18 12:07:31,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 12:07:31,805 INFO L276 IsEmpty]: Start isEmpty. Operand 16299 states and 48103 transitions. [2019-12-18 12:07:31,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:07:31,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:31,820 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 12:07:31,820 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:31,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:31,821 INFO L82 PathProgramCache]: Analyzing trace with hash -900170963, now seen corresponding path program 6 times [2019-12-18 12:07:31,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:31,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272825146] [2019-12-18 12:07:31,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:32,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:32,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272825146] [2019-12-18 12:07:32,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:32,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:07:32,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494928356] [2019-12-18 12:07:32,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:07:32,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:32,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:07:32,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:07:32,017 INFO L87 Difference]: Start difference. First operand 16299 states and 48103 transitions. Second operand 12 states. [2019-12-18 12:07:33,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:33,361 INFO L93 Difference]: Finished difference Result 21361 states and 62318 transitions. [2019-12-18 12:07:33,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:07:33,361 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 12:07:33,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:33,394 INFO L225 Difference]: With dead ends: 21361 [2019-12-18 12:07:33,394 INFO L226 Difference]: Without dead ends: 20549 [2019-12-18 12:07:33,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:07:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20549 states. [2019-12-18 12:07:33,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20549 to 16218. [2019-12-18 12:07:33,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16218 states. [2019-12-18 12:07:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16218 states to 16218 states and 47911 transitions. [2019-12-18 12:07:33,659 INFO L78 Accepts]: Start accepts. Automaton has 16218 states and 47911 transitions. Word has length 67 [2019-12-18 12:07:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:33,659 INFO L462 AbstractCegarLoop]: Abstraction has 16218 states and 47911 transitions. [2019-12-18 12:07:33,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:07:33,659 INFO L276 IsEmpty]: Start isEmpty. Operand 16218 states and 47911 transitions. [2019-12-18 12:07:33,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:07:33,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:33,675 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 12:07:33,675 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:33,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:33,675 INFO L82 PathProgramCache]: Analyzing trace with hash -96373001, now seen corresponding path program 7 times [2019-12-18 12:07:33,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:33,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429682174] [2019-12-18 12:07:33,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:34,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:34,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429682174] [2019-12-18 12:07:34,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:34,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 12:07:34,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538478315] [2019-12-18 12:07:34,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 12:07:34,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:34,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 12:07:34,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:07:34,180 INFO L87 Difference]: Start difference. First operand 16218 states and 47911 transitions. Second operand 17 states. [2019-12-18 12:07:36,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:36,259 INFO L93 Difference]: Finished difference Result 18625 states and 54410 transitions. [2019-12-18 12:07:36,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:07:36,260 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 12:07:36,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:36,282 INFO L225 Difference]: With dead ends: 18625 [2019-12-18 12:07:36,283 INFO L226 Difference]: Without dead ends: 17972 [2019-12-18 12:07:36,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2019-12-18 12:07:36,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17972 states. [2019-12-18 12:07:36,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17972 to 15967. [2019-12-18 12:07:36,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15967 states. [2019-12-18 12:07:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15967 states to 15967 states and 47003 transitions. [2019-12-18 12:07:36,515 INFO L78 Accepts]: Start accepts. Automaton has 15967 states and 47003 transitions. Word has length 67 [2019-12-18 12:07:36,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:36,515 INFO L462 AbstractCegarLoop]: Abstraction has 15967 states and 47003 transitions. [2019-12-18 12:07:36,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 12:07:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 15967 states and 47003 transitions. [2019-12-18 12:07:36,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:07:36,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:36,530 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 12:07:36,530 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:36,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:36,530 INFO L82 PathProgramCache]: Analyzing trace with hash -187199721, now seen corresponding path program 8 times [2019-12-18 12:07:36,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:36,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945009250] [2019-12-18 12:07:36,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:36,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:36,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945009250] [2019-12-18 12:07:36,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:36,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:07:36,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393154196] [2019-12-18 12:07:36,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:07:36,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:36,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:07:36,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:07:36,669 INFO L87 Difference]: Start difference. First operand 15967 states and 47003 transitions. Second operand 11 states. [2019-12-18 12:07:37,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:37,866 INFO L93 Difference]: Finished difference Result 32866 states and 96248 transitions. [2019-12-18 12:07:37,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 12:07:37,866 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:07:37,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:37,909 INFO L225 Difference]: With dead ends: 32866 [2019-12-18 12:07:37,909 INFO L226 Difference]: Without dead ends: 25193 [2019-12-18 12:07:37,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 12:07:38,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25193 states. [2019-12-18 12:07:38,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25193 to 14047. [2019-12-18 12:07:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14047 states. [2019-12-18 12:07:38,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14047 states to 14047 states and 41498 transitions. [2019-12-18 12:07:38,204 INFO L78 Accepts]: Start accepts. Automaton has 14047 states and 41498 transitions. Word has length 67 [2019-12-18 12:07:38,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:38,204 INFO L462 AbstractCegarLoop]: Abstraction has 14047 states and 41498 transitions. [2019-12-18 12:07:38,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:07:38,204 INFO L276 IsEmpty]: Start isEmpty. Operand 14047 states and 41498 transitions. [2019-12-18 12:07:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:07:38,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:38,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 12:07:38,218 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:38,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:38,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1475658587, now seen corresponding path program 9 times [2019-12-18 12:07:38,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:38,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475670506] [2019-12-18 12:07:38,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:07:38,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475670506] [2019-12-18 12:07:38,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:38,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:07:38,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203103800] [2019-12-18 12:07:38,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:07:38,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:38,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:07:38,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:07:38,360 INFO L87 Difference]: Start difference. First operand 14047 states and 41498 transitions. Second operand 11 states. [2019-12-18 12:07:39,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:39,198 INFO L93 Difference]: Finished difference Result 25068 states and 73787 transitions. [2019-12-18 12:07:39,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:07:39,199 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:07:39,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:39,230 INFO L225 Difference]: With dead ends: 25068 [2019-12-18 12:07:39,231 INFO L226 Difference]: Without dead ends: 24853 [2019-12-18 12:07:39,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:07:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24853 states. [2019-12-18 12:07:39,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24853 to 13871. [2019-12-18 12:07:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13871 states. [2019-12-18 12:07:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13871 states to 13871 states and 41042 transitions. [2019-12-18 12:07:39,500 INFO L78 Accepts]: Start accepts. Automaton has 13871 states and 41042 transitions. Word has length 67 [2019-12-18 12:07:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:39,500 INFO L462 AbstractCegarLoop]: Abstraction has 13871 states and 41042 transitions. [2019-12-18 12:07:39,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:07:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 13871 states and 41042 transitions. [2019-12-18 12:07:39,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:07:39,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:39,514 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 12:07:39,514 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:07:39,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:39,514 INFO L82 PathProgramCache]: Analyzing trace with hash -200373485, now seen corresponding path program 10 times [2019-12-18 12:07:39,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:39,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289327526] [2019-12-18 12:07:39,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:07:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:07:39,634 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:07:39,635 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:07:39,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_134 0) (= v_~a$r_buff1_thd0~0_110 0) (= v_~x~0_44 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd1~0_147) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t44~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t44~0.base_23|) |v_ULTIMATE.start_main_~#t44~0.offset_18| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_p0_EAX~0_60) (= 0 v_~a$w_buff0_used~0_862) (= v_~__unbuffered_p0_EBX~0_60 0) (= 0 v_~a$r_buff1_thd1~0_105) (= v_~main$tmp_guard1~0_27 0) (= v_~a$flush_delayed~0_24 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t44~0.base_23|) (= 0 |v_ULTIMATE.start_main_~#t44~0.offset_18|) (= v_~a~0_173 0) (= v_~a$r_buff1_thd3~0_219 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~a$r_buff0_thd3~0_314 0) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~__unbuffered_p2_EBX~0_35 0) (= 0 v_~a$r_buff1_thd2~0_106) (= 0 |v_#NULL.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_~#t44~0.base_23|) 0) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$w_buff0~0_390 0) (= 0 v_~a$r_buff0_thd2~0_104) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t44~0.base_23| 1)) (= v_~y~0_53 0) (= v_~a$mem_tmp~0_13 0) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_20 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t44~0.base_23| 4)) (= 0 v_~a$w_buff1~0_260) (= v_~weak$$choice2~0_108 0) (= v_~a$r_buff0_thd0~0_142 0) (= 0 v_~a$w_buff1_used~0_471) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_83|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_241|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_142, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ~a~0=v_~a~0_173, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ULTIMATE.start_main_~#t46~0.base=|v_ULTIMATE.start_main_~#t46~0.base_20|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ULTIMATE.start_main_~#t45~0.offset=|v_ULTIMATE.start_main_~#t45~0.offset_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_219, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_862, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_147, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_390, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, ~x~0=v_~x~0_44, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_61|, ULTIMATE.start_main_~#t46~0.offset=|v_ULTIMATE.start_main_~#t46~0.offset_15|, ULTIMATE.start_main_~#t45~0.base=|v_ULTIMATE.start_main_~#t45~0.base_23|, ~a$mem_tmp~0=v_~a$mem_tmp~0_13, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~a$w_buff1~0=v_~a$w_buff1~0_260, ~y~0=v_~y~0_53, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_105, ULTIMATE.start_main_~#t44~0.base=|v_ULTIMATE.start_main_~#t44~0.base_23|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_314, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t44~0.offset=|v_ULTIMATE.start_main_~#t44~0.offset_18|, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_24, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_471, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t46~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t45~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t46~0.offset, ULTIMATE.start_main_~#t45~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t44~0.base, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t44~0.offset, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 12:07:39,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] P0ENTRY-->L4-3: Formula: (and (= (mod ~a$w_buff1_used~0_Out985210967 256) 0) (= P0Thread1of1ForFork2_~arg.offset_Out985210967 |P0Thread1of1ForFork2_#in~arg.offset_In985210967|) (= ~a$w_buff0~0_In985210967 ~a$w_buff1~0_Out985210967) (= ~a$w_buff0_used~0_Out985210967 1) (= ~a$w_buff0~0_Out985210967 1) (= |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out985210967| 1) (= ~a$w_buff0_used~0_In985210967 ~a$w_buff1_used~0_Out985210967) (= |P0Thread1of1ForFork2_#in~arg.base_In985210967| P0Thread1of1ForFork2_~arg.base_Out985210967) (= |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out985210967| P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out985210967)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In985210967|, ~a$w_buff0~0=~a$w_buff0~0_In985210967, ~a$w_buff0_used~0=~a$w_buff0_used~0_In985210967, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In985210967|} OutVars{~a$w_buff1~0=~a$w_buff1~0_Out985210967, P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In985210967|, ~a$w_buff0~0=~a$w_buff0~0_Out985210967, P0Thread1of1ForFork2_~arg.offset=P0Thread1of1ForFork2_~arg.offset_Out985210967, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out985210967, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out985210967, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In985210967|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out985210967, P0Thread1of1ForFork2_~arg.base=P0Thread1of1ForFork2_~arg.base_Out985210967, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out985210967|} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork2_~arg.offset, ~a$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~a$w_buff1_used~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:07:39,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L842-1-->L844: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t45~0.base_13| 4)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t45~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t45~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t45~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t45~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t45~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t45~0.base_13|) |v_ULTIMATE.start_main_~#t45~0.offset_11| 1)) |v_#memory_int_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t45~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t45~0.base=|v_ULTIMATE.start_main_~#t45~0.base_13|, ULTIMATE.start_main_~#t45~0.offset=|v_ULTIMATE.start_main_~#t45~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t45~0.base, ULTIMATE.start_main_~#t45~0.offset] because there is no mapped edge [2019-12-18 12:07:39,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L783-2-->L783-5: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In2041073950 256) 0)) (.cse2 (= |P1Thread1of1ForFork0_#t~ite10_Out2041073950| |P1Thread1of1ForFork0_#t~ite9_Out2041073950|)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In2041073950 256)))) (or (and (or .cse0 .cse1) (= ~a~0_In2041073950 |P1Thread1of1ForFork0_#t~ite9_Out2041073950|) .cse2) (and (not .cse0) .cse2 (= |P1Thread1of1ForFork0_#t~ite9_Out2041073950| ~a$w_buff1~0_In2041073950) (not .cse1)))) InVars {~a~0=~a~0_In2041073950, ~a$w_buff1~0=~a$w_buff1~0_In2041073950, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2041073950, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2041073950} OutVars{~a~0=~a~0_In2041073950, ~a$w_buff1~0=~a$w_buff1~0_In2041073950, P1Thread1of1ForFork0_#t~ite10=|P1Thread1of1ForFork0_#t~ite10_Out2041073950|, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2041073950, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out2041073950|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2041073950} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-18 12:07:39,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In89700333 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In89700333 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite11_Out89700333|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite11_Out89700333| ~a$w_buff0_used~0_In89700333)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In89700333, ~a$w_buff0_used~0=~a$w_buff0_used~0_In89700333} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In89700333, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out89700333|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In89700333} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 12:07:39,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L785-->L785-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1169114789 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-1169114789 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd2~0_In-1169114789 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-1169114789 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite12_Out-1169114789| ~a$w_buff1_used~0_In-1169114789) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork0_#t~ite12_Out-1169114789| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1169114789, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1169114789, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1169114789, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1169114789} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1169114789, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1169114789, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out-1169114789|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1169114789, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1169114789} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 12:07:39,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1259562454 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1259562454 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In1259562454 |P1Thread1of1ForFork0_#t~ite13_Out1259562454|)) (and (= |P1Thread1of1ForFork0_#t~ite13_Out1259562454| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1259562454, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1259562454} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1259562454, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1259562454, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out1259562454|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 12:07:39,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L787-->L787-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-2122707888 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-2122707888 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-2122707888 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-2122707888 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite14_Out-2122707888|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$r_buff1_thd2~0_In-2122707888 |P1Thread1of1ForFork0_#t~ite14_Out-2122707888|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2122707888, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2122707888, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2122707888, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2122707888} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2122707888, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2122707888, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2122707888, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-2122707888|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2122707888} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 12:07:39,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L787-2-->P1EXIT: Formula: (and (= v_~a$r_buff1_thd2~0_53 |v_P1Thread1of1ForFork0_#t~ite14_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_28|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_53, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_27|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 12:07:39,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t46~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t46~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t46~0.base_12| 1)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t46~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t46~0.base_12|) |v_ULTIMATE.start_main_~#t46~0.offset_10| 2))) (not (= 0 |v_ULTIMATE.start_main_~#t46~0.base_12|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t46~0.base_12| 4)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t46~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t46~0.base=|v_ULTIMATE.start_main_~#t46~0.base_12|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t46~0.offset=|v_ULTIMATE.start_main_~#t46~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t46~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t46~0.offset] because there is no mapped edge [2019-12-18 12:07:39,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2100814645 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite20_In-2100814645| |P2Thread1of1ForFork1_#t~ite20_Out-2100814645|) (= ~a$w_buff0~0_In-2100814645 |P2Thread1of1ForFork1_#t~ite21_Out-2100814645|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-2100814645 256)))) (or (and (= (mod ~a$r_buff1_thd3~0_In-2100814645 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-2100814645 256)) (and (= 0 (mod ~a$w_buff1_used~0_In-2100814645 256)) .cse1))) (= ~a$w_buff0~0_In-2100814645 |P2Thread1of1ForFork1_#t~ite20_Out-2100814645|) (= |P2Thread1of1ForFork1_#t~ite21_Out-2100814645| |P2Thread1of1ForFork1_#t~ite20_Out-2100814645|) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In-2100814645|, ~a$w_buff0~0=~a$w_buff0~0_In-2100814645, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2100814645, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2100814645, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2100814645, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2100814645, ~weak$$choice2~0=~weak$$choice2~0_In-2100814645} OutVars{P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out-2100814645|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out-2100814645|, ~a$w_buff0~0=~a$w_buff0~0_In-2100814645, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2100814645, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2100814645, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2100814645, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2100814645, ~weak$$choice2~0=~weak$$choice2~0_In-2100814645} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 12:07:39,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-58135571 256)))) (or (and (= ~a$w_buff0_used~0_In-58135571 |P2Thread1of1ForFork1_#t~ite27_Out-58135571|) (= |P2Thread1of1ForFork1_#t~ite26_In-58135571| |P2Thread1of1ForFork1_#t~ite26_Out-58135571|) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite27_Out-58135571| |P2Thread1of1ForFork1_#t~ite26_Out-58135571|) .cse0 (= ~a$w_buff0_used~0_In-58135571 |P2Thread1of1ForFork1_#t~ite26_Out-58135571|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-58135571 256)))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In-58135571 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In-58135571 256)) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-58135571 256) 0))))))) InVars {P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-58135571|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-58135571, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-58135571, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-58135571, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-58135571, ~weak$$choice2~0=~weak$$choice2~0_In-58135571} OutVars{P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-58135571|, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-58135571|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-58135571, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-58135571, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-58135571, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-58135571, ~weak$$choice2~0=~weak$$choice2~0_In-58135571} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-18 12:07:39,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L812-->L813: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33, ~a$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 12:07:39,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L815-->L819: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_42 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_42, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite37, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 12:07:39,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L819-2-->L819-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1827789519 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1827789519 256)))) (or (and (or .cse0 .cse1) (= ~a~0_In-1827789519 |P2Thread1of1ForFork1_#t~ite38_Out-1827789519|)) (and (not .cse0) (= ~a$w_buff1~0_In-1827789519 |P2Thread1of1ForFork1_#t~ite38_Out-1827789519|) (not .cse1)))) InVars {~a~0=~a~0_In-1827789519, ~a$w_buff1~0=~a$w_buff1~0_In-1827789519, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1827789519, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1827789519} OutVars{~a~0=~a~0_In-1827789519, P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-1827789519|, ~a$w_buff1~0=~a$w_buff1~0_In-1827789519, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1827789519, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1827789519} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-18 12:07:39,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-4-->L820: Formula: (= v_~a~0_31 |v_P2Thread1of1ForFork1_#t~ite38_14|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_14|} OutVars{~a~0=v_~a~0_31, P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_13|, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_13|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite38, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-18 12:07:39,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-897108457 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-897108457 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite40_Out-897108457|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-897108457 |P2Thread1of1ForFork1_#t~ite40_Out-897108457|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-897108457, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-897108457} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-897108457, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-897108457, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-897108457|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-18 12:07:39,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In1361964351 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1361964351 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1361964351 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In1361964351 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite41_Out1361964351|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In1361964351 |P2Thread1of1ForFork1_#t~ite41_Out1361964351|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1361964351, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1361964351, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1361964351, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1361964351} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1361964351, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1361964351, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1361964351, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out1361964351|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1361964351} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-18 12:07:39,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1785301099 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1785301099 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite42_Out1785301099|)) (and (= ~a$r_buff0_thd3~0_In1785301099 |P2Thread1of1ForFork1_#t~ite42_Out1785301099|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1785301099, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1785301099} OutVars{P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out1785301099|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1785301099, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1785301099} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-18 12:07:39,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L823-->L823-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd3~0_In-1589021952 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1589021952 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-1589021952 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1589021952 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite43_Out-1589021952| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite43_Out-1589021952| ~a$r_buff1_thd3~0_In-1589021952) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1589021952, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1589021952, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1589021952, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1589021952} OutVars{P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-1589021952|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1589021952, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1589021952, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1589021952, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1589021952} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-18 12:07:39,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~a$r_buff1_thd3~0_109 |v_P2Thread1of1ForFork1_#t~ite43_34|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_33|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_109, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 12:07:39,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L761-->L761-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1287091474 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1287091474 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork2_#t~ite5_Out-1287091474| ~a$w_buff0_used~0_In-1287091474)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite5_Out-1287091474| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1287091474, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1287091474} OutVars{P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out-1287091474|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1287091474, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1287091474} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 12:07:39,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L762-->L762-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In661091757 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In661091757 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In661091757 256))) (.cse3 (= (mod ~a$r_buff1_thd1~0_In661091757 256) 0))) (or (and (= ~a$w_buff1_used~0_In661091757 |P0Thread1of1ForFork2_#t~ite6_Out661091757|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork2_#t~ite6_Out661091757|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In661091757, ~a$w_buff0_used~0=~a$w_buff0_used~0_In661091757, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In661091757, ~a$w_buff1_used~0=~a$w_buff1_used~0_In661091757} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In661091757, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out661091757|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In661091757, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In661091757, ~a$w_buff1_used~0=~a$w_buff1_used~0_In661091757} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 12:07:39,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L763-->L764: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-608868650 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-608868650 256) 0))) (or (and (= ~a$r_buff0_thd1~0_Out-608868650 0) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd1~0_Out-608868650 ~a$r_buff0_thd1~0_In-608868650) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-608868650, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-608868650} OutVars{P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-608868650|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-608868650, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-608868650} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:07:39,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L764-->L764-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd1~0_In1084866299 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In1084866299 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1084866299 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In1084866299 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_Out1084866299| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork2_#t~ite8_Out1084866299| ~a$r_buff1_thd1~0_In1084866299)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1084866299, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1084866299, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1084866299, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1084866299} OutVars{P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1084866299|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1084866299, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1084866299, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1084866299, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1084866299} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 12:07:39,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L764-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_44| v_~a$r_buff1_thd1~0_72) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_43|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, ~a$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:07:39,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:07:39,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L852-2-->L852-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In1972895549 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1972895549 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out1972895549| ~a~0_In1972895549)) (and (not .cse0) (= ~a$w_buff1~0_In1972895549 |ULTIMATE.start_main_#t~ite47_Out1972895549|) (not .cse1)))) InVars {~a~0=~a~0_In1972895549, ~a$w_buff1~0=~a$w_buff1~0_In1972895549, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1972895549, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1972895549} OutVars{~a~0=~a~0_In1972895549, ~a$w_buff1~0=~a$w_buff1~0_In1972895549, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1972895549|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1972895549, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1972895549} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:07:39,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L852-4-->L853: Formula: (= v_~a~0_58 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_58, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:07:39,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1293529099 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In1293529099 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out1293529099|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1293529099 |ULTIMATE.start_main_#t~ite49_Out1293529099|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1293529099, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1293529099} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1293529099, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1293529099|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1293529099} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:07:39,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L854-->L854-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd0~0_In1369773998 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1369773998 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1369773998 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1369773998 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out1369773998| 0)) (and (= |ULTIMATE.start_main_#t~ite50_Out1369773998| ~a$w_buff1_used~0_In1369773998) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1369773998, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1369773998, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1369773998, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1369773998} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1369773998|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1369773998, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1369773998, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1369773998, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1369773998} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:07:39,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L855-->L855-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-739131878 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-739131878 256) 0))) (or (and (= ~a$r_buff0_thd0~0_In-739131878 |ULTIMATE.start_main_#t~ite51_Out-739131878|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-739131878|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-739131878, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-739131878} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-739131878|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-739131878, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-739131878} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:07:39,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L856-->L856-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-1595957639 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1595957639 256))) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-1595957639 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1595957639 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-1595957639| ~a$r_buff1_thd0~0_In-1595957639) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out-1595957639| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1595957639, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1595957639, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1595957639, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1595957639} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1595957639|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1595957639, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1595957639, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1595957639, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1595957639} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:07:39,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_21 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_21 256)) (= 1 v_~__unbuffered_p1_EAX~0_27) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~a$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite52_44|) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_54) (= 1 v_~__unbuffered_p2_EAX~0_24)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_44|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:07:39,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:07:39 BasicIcfg [2019-12-18 12:07:39,786 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:07:39,788 INFO L168 Benchmark]: Toolchain (without parser) took 123818.23 ms. Allocated memory was 139.5 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 101.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 12:07:39,788 INFO L168 Benchmark]: CDTParser took 1.41 ms. Allocated memory is still 139.5 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 12:07:39,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.22 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 101.3 MB in the beginning and 157.9 MB in the end (delta: -56.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-12-18 12:07:39,789 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.64 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:07:39,789 INFO L168 Benchmark]: Boogie Preprocessor took 70.75 ms. Allocated memory is still 203.9 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:07:39,790 INFO L168 Benchmark]: RCFGBuilder took 968.50 ms. Allocated memory is still 203.9 MB. Free memory was 152.6 MB in the beginning and 101.0 MB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:07:39,790 INFO L168 Benchmark]: TraceAbstraction took 121936.35 ms. Allocated memory was 203.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 101.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 12:07:39,793 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41 ms. Allocated memory is still 139.5 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 770.22 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 101.3 MB in the beginning and 157.9 MB in the end (delta: -56.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.64 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.75 ms. Allocated memory is still 203.9 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 968.50 ms. Allocated memory is still 203.9 MB. Free memory was 152.6 MB in the beginning and 101.0 MB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 121936.35 ms. Allocated memory was 203.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 101.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 180 ProgramPointsBefore, 95 ProgramPointsAfterwards, 217 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7415 VarBasedMoverChecksPositive, 242 VarBasedMoverChecksNegative, 41 SemBasedMoverChecksPositive, 273 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 93316 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t44, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L744] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L745] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L746] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L747] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L748] 1 a$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 [L754] 1 __unbuffered_p0_EAX = x [L757] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t45, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L774] 2 y = 1 [L777] 2 __unbuffered_p1_EAX = y [L780] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L760] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L783] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L846] FCALL, FORK 0 pthread_create(&t46, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L797] 3 z = 1 [L800] 3 __unbuffered_p2_EAX = z [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L808] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L809] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L809] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L810] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L852] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L855] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 121.5s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 54.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8800 SDtfs, 13366 SDslu, 37869 SDs, 0 SdLazy, 28330 SolverSat, 636 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 598 GetRequests, 49 SyntacticMatches, 17 SemanticMatches, 532 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4154 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162301occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 36.0s AutomataMinimizationTime, 33 MinimizatonAttempts, 370359 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1753 NumberOfCodeBlocks, 1753 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1653 ConstructedInterpolants, 0 QuantifiedInterpolants, 522324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...