/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_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:04:54,685 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:04:54,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:04:54,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:04:54,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:04:54,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:04:54,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:04:54,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:04:54,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:04:54,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:04:54,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:04:54,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:04:54,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:04:54,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:04:54,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:04:54,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:04:54,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:04:54,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:04:54,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:04:54,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:04:54,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:04:54,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:04:54,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:04:54,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:04:54,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:04:54,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:04:54,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:04:54,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:04:54,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:04:54,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:04:54,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:04:54,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:04:54,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:04:54,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:04:54,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:04:54,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:04:54,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:04:54,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:04:54,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:04:54,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:04:54,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:04:54,772 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:04:54,806 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:04:54,806 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:04:54,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:04:54,814 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:04:54,814 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:04:54,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:04:54,815 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:04:54,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:04:54,815 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:04:54,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:04:54,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:04:54,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:04:54,816 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:04:54,816 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:04:54,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:04:54,816 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:04:54,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:04:54,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:04:54,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:04:54,817 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:04:54,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:04:54,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:04:54,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:04:54,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:04:54,818 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:04:54,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:04:54,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:04:54,820 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:04:54,820 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:04:54,820 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:04:55,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:04:55,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:04:55,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:04:55,188 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:04:55,188 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:04:55,189 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_power.oepc.i [2019-12-18 12:04:55,260 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d4e5c10/5dcf3e58430f404bbff049de2bd959a3/FLAGd3f64c141 [2019-12-18 12:04:55,782 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:04:55,783 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_power.oepc.i [2019-12-18 12:04:55,803 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d4e5c10/5dcf3e58430f404bbff049de2bd959a3/FLAGd3f64c141 [2019-12-18 12:04:56,090 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d4e5c10/5dcf3e58430f404bbff049de2bd959a3 [2019-12-18 12:04:56,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:04:56,103 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:04:56,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:04:56,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:04:56,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:04:56,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:04:56" (1/1) ... [2019-12-18 12:04:56,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18316cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:56, skipping insertion in model container [2019-12-18 12:04:56,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:04:56" (1/1) ... [2019-12-18 12:04:56,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:04:56,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:04:56,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:04:56,844 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:04:56,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:04:56,991 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:04:56,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:56 WrapperNode [2019-12-18 12:04:56,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:04:56,992 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:04:56,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:04:56,993 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:04:57,002 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:04:56" (1/1) ... [2019-12-18 12:04:57,035 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:04:56" (1/1) ... [2019-12-18 12:04:57,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:04:57,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:04:57,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:04:57,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:04:57,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:56" (1/1) ... [2019-12-18 12:04:57,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:56" (1/1) ... [2019-12-18 12:04:57,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:56" (1/1) ... [2019-12-18 12:04:57,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:56" (1/1) ... [2019-12-18 12:04:57,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:56" (1/1) ... [2019-12-18 12:04:57,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:56" (1/1) ... [2019-12-18 12:04:57,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:56" (1/1) ... [2019-12-18 12:04:57,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:04:57,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:04:57,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:04:57,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:04:57,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:56" (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:04:57,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:04:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:04:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:04:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:04:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:04:57,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:04:57,202 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:04:57,203 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:04:57,203 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:04:57,204 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:04:57,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:04:57,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:04:57,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:04:57,206 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:04:58,013 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:04:58,014 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:04:58,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:04:58 BoogieIcfgContainer [2019-12-18 12:04:58,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:04:58,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:04:58,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:04:58,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:04:58,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:04:56" (1/3) ... [2019-12-18 12:04:58,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15081aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:04:58, skipping insertion in model container [2019-12-18 12:04:58,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:56" (2/3) ... [2019-12-18 12:04:58,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15081aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:04:58, skipping insertion in model container [2019-12-18 12:04:58,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:04:58" (3/3) ... [2019-12-18 12:04:58,025 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_power.oepc.i [2019-12-18 12:04:58,035 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:04:58,036 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:04:58,044 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:04:58,045 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:04:58,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,088 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,089 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,089 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,090 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,090 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,125 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,125 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,132 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,133 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,158 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,158 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,165 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,167 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,183 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,184 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,191 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:58,211 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:04:58,232 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:04:58,232 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:04:58,232 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:04:58,233 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:04:58,233 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:04:58,233 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:04:58,233 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:04:58,233 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:04:58,250 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-18 12:04:58,252 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-18 12:04:58,342 INFO L126 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-18 12:04:58,342 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:04:58,363 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:04:58,392 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-18 12:04:58,483 INFO L126 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-18 12:04:58,483 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:04:58,499 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:04:58,522 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:04:58,523 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:05:01,937 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-12-18 12:05:03,537 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-12-18 12:05:04,099 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 12:05:04,271 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 12:05:04,461 INFO L206 etLargeBlockEncoding]: Checked pairs total: 93316 [2019-12-18 12:05:04,462 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 12:05:04,466 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 104 transitions [2019-12-18 12:05:23,728 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-18 12:05:23,729 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-18 12:05:23,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:05:23,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:05:23,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:05:23,735 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:05:23,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:05:23,740 INFO L82 PathProgramCache]: Analyzing trace with hash 922900, now seen corresponding path program 1 times [2019-12-18 12:05:23,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:05:23,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691573722] [2019-12-18 12:05:23,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:05:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:05:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:05:23,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691573722] [2019-12-18 12:05:23,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:05:23,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:05:23,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104584211] [2019-12-18 12:05:24,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:05:24,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:05:24,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:05:24,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:05:24,021 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-18 12:05:25,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:05:25,500 INFO L93 Difference]: Finished difference Result 119349 states and 508327 transitions. [2019-12-18 12:05:25,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:05:25,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:05:25,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:05:26,135 INFO L225 Difference]: With dead ends: 119349 [2019-12-18 12:05:26,136 INFO L226 Difference]: Without dead ends: 112420 [2019-12-18 12:05:26,137 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:05:34,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112420 states. [2019-12-18 12:05:36,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112420 to 112420. [2019-12-18 12:05:36,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112420 states. [2019-12-18 12:05:37,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112420 states to 112420 states and 478219 transitions. [2019-12-18 12:05:37,300 INFO L78 Accepts]: Start accepts. Automaton has 112420 states and 478219 transitions. Word has length 3 [2019-12-18 12:05:37,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:05:37,300 INFO L462 AbstractCegarLoop]: Abstraction has 112420 states and 478219 transitions. [2019-12-18 12:05:37,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:05:37,300 INFO L276 IsEmpty]: Start isEmpty. Operand 112420 states and 478219 transitions. [2019-12-18 12:05:37,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:05:37,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:05:37,304 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:05:37,305 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:05:37,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:05:37,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1739393843, now seen corresponding path program 1 times [2019-12-18 12:05:37,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:05:37,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249656487] [2019-12-18 12:05:37,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:05:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:05:37,398 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:05:37,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249656487] [2019-12-18 12:05:37,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:05:37,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:05:37,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089416765] [2019-12-18 12:05:37,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:05:37,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:05:37,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:05:37,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:05:37,403 INFO L87 Difference]: Start difference. First operand 112420 states and 478219 transitions. Second operand 4 states. [2019-12-18 12:05:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:05:42,468 INFO L93 Difference]: Finished difference Result 179210 states and 732067 transitions. [2019-12-18 12:05:42,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:05:42,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:05:42,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:05:43,175 INFO L225 Difference]: With dead ends: 179210 [2019-12-18 12:05:43,175 INFO L226 Difference]: Without dead ends: 179161 [2019-12-18 12:05:43,176 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:05:49,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179161 states. [2019-12-18 12:05:57,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179161 to 162301. [2019-12-18 12:05:57,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162301 states. [2019-12-18 12:05:58,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162301 states to 162301 states and 672031 transitions. [2019-12-18 12:05:58,188 INFO L78 Accepts]: Start accepts. Automaton has 162301 states and 672031 transitions. Word has length 11 [2019-12-18 12:05:58,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:05:58,188 INFO L462 AbstractCegarLoop]: Abstraction has 162301 states and 672031 transitions. [2019-12-18 12:05:58,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:05:58,189 INFO L276 IsEmpty]: Start isEmpty. Operand 162301 states and 672031 transitions. [2019-12-18 12:05:58,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:05:58,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:05:58,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:05:58,195 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:05:58,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:05:58,196 INFO L82 PathProgramCache]: Analyzing trace with hash 53844596, now seen corresponding path program 1 times [2019-12-18 12:05:58,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:05:58,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312998661] [2019-12-18 12:05:58,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:05:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:05:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:05:58,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312998661] [2019-12-18 12:05:58,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:05:58,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:05:58,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084977031] [2019-12-18 12:05:58,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:05:58,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:05:58,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:05:58,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:05:58,266 INFO L87 Difference]: Start difference. First operand 162301 states and 672031 transitions. Second operand 3 states. [2019-12-18 12:05:59,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:05:59,897 INFO L93 Difference]: Finished difference Result 34811 states and 113031 transitions. [2019-12-18 12:05:59,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:05:59,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:05:59,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:00,019 INFO L225 Difference]: With dead ends: 34811 [2019-12-18 12:06:00,019 INFO L226 Difference]: Without dead ends: 34811 [2019-12-18 12:06:00,020 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:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34811 states. [2019-12-18 12:06:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34811 to 34811. [2019-12-18 12:06:00,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34811 states. [2019-12-18 12:06:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34811 states to 34811 states and 113031 transitions. [2019-12-18 12:06:00,780 INFO L78 Accepts]: Start accepts. Automaton has 34811 states and 113031 transitions. Word has length 13 [2019-12-18 12:06:00,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:00,780 INFO L462 AbstractCegarLoop]: Abstraction has 34811 states and 113031 transitions. [2019-12-18 12:06:00,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:06:00,781 INFO L276 IsEmpty]: Start isEmpty. Operand 34811 states and 113031 transitions. [2019-12-18 12:06:00,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:06:00,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:00,784 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:00,784 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:00,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:00,784 INFO L82 PathProgramCache]: Analyzing trace with hash -2104175705, now seen corresponding path program 1 times [2019-12-18 12:06:00,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:00,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488663355] [2019-12-18 12:06:00,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:00,949 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:00,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488663355] [2019-12-18 12:06:00,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:00,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:06:00,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929233957] [2019-12-18 12:06:00,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:06:00,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:00,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:06:00,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:06:00,954 INFO L87 Difference]: Start difference. First operand 34811 states and 113031 transitions. Second operand 5 states. [2019-12-18 12:06:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:01,545 INFO L93 Difference]: Finished difference Result 48236 states and 154913 transitions. [2019-12-18 12:06:01,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:06:01,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 12:06:01,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:01,640 INFO L225 Difference]: With dead ends: 48236 [2019-12-18 12:06:01,641 INFO L226 Difference]: Without dead ends: 48236 [2019-12-18 12:06:01,641 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:01,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-12-18 12:06:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 41215. [2019-12-18 12:06:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41215 states. [2019-12-18 12:06:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41215 states to 41215 states and 133442 transitions. [2019-12-18 12:06:05,093 INFO L78 Accepts]: Start accepts. Automaton has 41215 states and 133442 transitions. Word has length 16 [2019-12-18 12:06:05,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:05,095 INFO L462 AbstractCegarLoop]: Abstraction has 41215 states and 133442 transitions. [2019-12-18 12:06:05,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:06:05,098 INFO L276 IsEmpty]: Start isEmpty. Operand 41215 states and 133442 transitions. [2019-12-18 12:06:05,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:06:05,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:05,108 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:05,109 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:05,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:05,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1566659883, now seen corresponding path program 1 times [2019-12-18 12:06:05,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:05,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874625412] [2019-12-18 12:06:05,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:05,257 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:05,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874625412] [2019-12-18 12:06:05,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:05,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:06:05,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399262912] [2019-12-18 12:06:05,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:06:05,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:05,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:06:05,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:06:05,260 INFO L87 Difference]: Start difference. First operand 41215 states and 133442 transitions. Second operand 6 states. [2019-12-18 12:06:06,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:06,176 INFO L93 Difference]: Finished difference Result 62182 states and 196414 transitions. [2019-12-18 12:06:06,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:06:06,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 12:06:06,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:06,277 INFO L225 Difference]: With dead ends: 62182 [2019-12-18 12:06:06,277 INFO L226 Difference]: Without dead ends: 62175 [2019-12-18 12:06:06,278 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:06,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62175 states. [2019-12-18 12:06:07,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62175 to 40995. [2019-12-18 12:06:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40995 states. [2019-12-18 12:06:07,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40995 states to 40995 states and 132031 transitions. [2019-12-18 12:06:07,141 INFO L78 Accepts]: Start accepts. Automaton has 40995 states and 132031 transitions. Word has length 22 [2019-12-18 12:06:07,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:07,141 INFO L462 AbstractCegarLoop]: Abstraction has 40995 states and 132031 transitions. [2019-12-18 12:06:07,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:06:07,141 INFO L276 IsEmpty]: Start isEmpty. Operand 40995 states and 132031 transitions. [2019-12-18 12:06:07,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:06:07,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:07,155 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:07,155 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:07,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:07,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1076429505, now seen corresponding path program 1 times [2019-12-18 12:06:07,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:07,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049751802] [2019-12-18 12:06:07,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:07,203 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:07,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049751802] [2019-12-18 12:06:07,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:07,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:06:07,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882612533] [2019-12-18 12:06:07,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:06:07,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:07,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:06:07,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:06:07,205 INFO L87 Difference]: Start difference. First operand 40995 states and 132031 transitions. Second operand 4 states. [2019-12-18 12:06:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:07,615 INFO L93 Difference]: Finished difference Result 16196 states and 49196 transitions. [2019-12-18 12:06:07,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:06:07,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:06:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:07,637 INFO L225 Difference]: With dead ends: 16196 [2019-12-18 12:06:07,637 INFO L226 Difference]: Without dead ends: 16196 [2019-12-18 12:06:07,637 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:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16196 states. [2019-12-18 12:06:07,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16196 to 15833. [2019-12-18 12:06:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15833 states. [2019-12-18 12:06:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15833 states to 15833 states and 48160 transitions. [2019-12-18 12:06:07,903 INFO L78 Accepts]: Start accepts. Automaton has 15833 states and 48160 transitions. Word has length 25 [2019-12-18 12:06:07,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:07,903 INFO L462 AbstractCegarLoop]: Abstraction has 15833 states and 48160 transitions. [2019-12-18 12:06:07,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:06:07,903 INFO L276 IsEmpty]: Start isEmpty. Operand 15833 states and 48160 transitions. [2019-12-18 12:06:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:06:07,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:07,915 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:07,915 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:07,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:07,916 INFO L82 PathProgramCache]: Analyzing trace with hash -877586735, now seen corresponding path program 1 times [2019-12-18 12:06:07,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:07,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414673609] [2019-12-18 12:06:07,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:07,975 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:07,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414673609] [2019-12-18 12:06:07,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:07,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:06:07,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720132744] [2019-12-18 12:06:07,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:06:07,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:07,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:06:07,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:07,977 INFO L87 Difference]: Start difference. First operand 15833 states and 48160 transitions. Second operand 3 states. [2019-12-18 12:06:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:08,083 INFO L93 Difference]: Finished difference Result 23073 states and 68792 transitions. [2019-12-18 12:06:08,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:06:08,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:06:08,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:08,116 INFO L225 Difference]: With dead ends: 23073 [2019-12-18 12:06:08,117 INFO L226 Difference]: Without dead ends: 23073 [2019-12-18 12:06:08,117 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:08,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23073 states. [2019-12-18 12:06:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23073 to 17600. [2019-12-18 12:06:08,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17600 states. [2019-12-18 12:06:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17600 states to 17600 states and 53010 transitions. [2019-12-18 12:06:08,442 INFO L78 Accepts]: Start accepts. Automaton has 17600 states and 53010 transitions. Word has length 27 [2019-12-18 12:06:08,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:08,443 INFO L462 AbstractCegarLoop]: Abstraction has 17600 states and 53010 transitions. [2019-12-18 12:06:08,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:06:08,443 INFO L276 IsEmpty]: Start isEmpty. Operand 17600 states and 53010 transitions. [2019-12-18 12:06:08,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:06:08,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:08,456 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:08,456 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:08,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:08,456 INFO L82 PathProgramCache]: Analyzing trace with hash -603523497, now seen corresponding path program 1 times [2019-12-18 12:06:08,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:08,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560918215] [2019-12-18 12:06:08,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:08,534 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:08,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560918215] [2019-12-18 12:06:08,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:08,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:06:08,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65726583] [2019-12-18 12:06:08,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:06:08,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:08,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:06:08,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:06:08,537 INFO L87 Difference]: Start difference. First operand 17600 states and 53010 transitions. Second operand 6 states. [2019-12-18 12:06:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:09,119 INFO L93 Difference]: Finished difference Result 24767 states and 72789 transitions. [2019-12-18 12:06:09,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:06:09,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:06:09,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:09,153 INFO L225 Difference]: With dead ends: 24767 [2019-12-18 12:06:09,153 INFO L226 Difference]: Without dead ends: 24767 [2019-12-18 12:06:09,153 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:09,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24767 states. [2019-12-18 12:06:09,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24767 to 20286. [2019-12-18 12:06:09,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20286 states. [2019-12-18 12:06:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20286 states to 20286 states and 60759 transitions. [2019-12-18 12:06:09,484 INFO L78 Accepts]: Start accepts. Automaton has 20286 states and 60759 transitions. Word has length 27 [2019-12-18 12:06:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:09,484 INFO L462 AbstractCegarLoop]: Abstraction has 20286 states and 60759 transitions. [2019-12-18 12:06:09,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:06:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 20286 states and 60759 transitions. [2019-12-18 12:06:09,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:06:09,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:09,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:06:09,506 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:09,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:09,507 INFO L82 PathProgramCache]: Analyzing trace with hash 94968403, now seen corresponding path program 1 times [2019-12-18 12:06:09,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:09,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544990258] [2019-12-18 12:06:09,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:09,602 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:09,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544990258] [2019-12-18 12:06:09,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:09,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:06:09,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551140974] [2019-12-18 12:06:09,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:06:09,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:09,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:06:09,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:06:09,604 INFO L87 Difference]: Start difference. First operand 20286 states and 60759 transitions. Second operand 7 states. [2019-12-18 12:06:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:10,825 INFO L93 Difference]: Finished difference Result 27601 states and 80773 transitions. [2019-12-18 12:06:10,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:06:10,826 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 12:06:10,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:10,863 INFO L225 Difference]: With dead ends: 27601 [2019-12-18 12:06:10,864 INFO L226 Difference]: Without dead ends: 27601 [2019-12-18 12:06:10,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:06:10,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27601 states. [2019-12-18 12:06:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27601 to 18412. [2019-12-18 12:06:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18412 states. [2019-12-18 12:06:11,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18412 states to 18412 states and 55362 transitions. [2019-12-18 12:06:11,434 INFO L78 Accepts]: Start accepts. Automaton has 18412 states and 55362 transitions. Word has length 33 [2019-12-18 12:06:11,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:11,434 INFO L462 AbstractCegarLoop]: Abstraction has 18412 states and 55362 transitions. [2019-12-18 12:06:11,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:06:11,435 INFO L276 IsEmpty]: Start isEmpty. Operand 18412 states and 55362 transitions. [2019-12-18 12:06:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:06:11,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:11,458 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:11,458 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:11,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:11,458 INFO L82 PathProgramCache]: Analyzing trace with hash 994852703, now seen corresponding path program 1 times [2019-12-18 12:06:11,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:11,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558980217] [2019-12-18 12:06:11,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:11,516 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:11,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558980217] [2019-12-18 12:06:11,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:11,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:06:11,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816100385] [2019-12-18 12:06:11,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:06:11,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:11,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:06:11,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:11,518 INFO L87 Difference]: Start difference. First operand 18412 states and 55362 transitions. Second operand 3 states. [2019-12-18 12:06:11,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:11,596 INFO L93 Difference]: Finished difference Result 18411 states and 55360 transitions. [2019-12-18 12:06:11,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:06:11,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:06:11,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:11,633 INFO L225 Difference]: With dead ends: 18411 [2019-12-18 12:06:11,634 INFO L226 Difference]: Without dead ends: 18411 [2019-12-18 12:06:11,634 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:11,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2019-12-18 12:06:11,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 18411. [2019-12-18 12:06:11,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18411 states. [2019-12-18 12:06:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18411 states to 18411 states and 55360 transitions. [2019-12-18 12:06:11,911 INFO L78 Accepts]: Start accepts. Automaton has 18411 states and 55360 transitions. Word has length 39 [2019-12-18 12:06:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:11,912 INFO L462 AbstractCegarLoop]: Abstraction has 18411 states and 55360 transitions. [2019-12-18 12:06:11,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:06:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 18411 states and 55360 transitions. [2019-12-18 12:06:11,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:06:11,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:11,935 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:11,935 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:11,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:11,935 INFO L82 PathProgramCache]: Analyzing trace with hash 467911076, now seen corresponding path program 1 times [2019-12-18 12:06:11,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:11,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504977185] [2019-12-18 12:06:11,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:12,039 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:12,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504977185] [2019-12-18 12:06:12,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:12,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:06:12,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886617141] [2019-12-18 12:06:12,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:06:12,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:12,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:06:12,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:12,043 INFO L87 Difference]: Start difference. First operand 18411 states and 55360 transitions. Second operand 3 states. [2019-12-18 12:06:12,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:12,122 INFO L93 Difference]: Finished difference Result 18325 states and 55099 transitions. [2019-12-18 12:06:12,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:06:12,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 12:06:12,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:12,155 INFO L225 Difference]: With dead ends: 18325 [2019-12-18 12:06:12,155 INFO L226 Difference]: Without dead ends: 18325 [2019-12-18 12:06:12,156 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:12,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18325 states. [2019-12-18 12:06:12,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18325 to 16323. [2019-12-18 12:06:12,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16323 states. [2019-12-18 12:06:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16323 states to 16323 states and 49617 transitions. [2019-12-18 12:06:12,429 INFO L78 Accepts]: Start accepts. Automaton has 16323 states and 49617 transitions. Word has length 40 [2019-12-18 12:06:12,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:12,429 INFO L462 AbstractCegarLoop]: Abstraction has 16323 states and 49617 transitions. [2019-12-18 12:06:12,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:06:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 16323 states and 49617 transitions. [2019-12-18 12:06:12,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 12:06:12,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:12,446 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:12,446 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:12,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:12,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1873584483, now seen corresponding path program 1 times [2019-12-18 12:06:12,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:12,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148202024] [2019-12-18 12:06:12,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:12,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:12,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148202024] [2019-12-18 12:06:12,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:12,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:06:12,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712477690] [2019-12-18 12:06:12,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:06:12,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:12,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:06:12,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:06:12,511 INFO L87 Difference]: Start difference. First operand 16323 states and 49617 transitions. Second operand 5 states. [2019-12-18 12:06:12,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:12,583 INFO L93 Difference]: Finished difference Result 15143 states and 47024 transitions. [2019-12-18 12:06:12,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:06:12,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 12:06:12,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:12,605 INFO L225 Difference]: With dead ends: 15143 [2019-12-18 12:06:12,605 INFO L226 Difference]: Without dead ends: 15143 [2019-12-18 12:06:12,606 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:12,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15143 states. [2019-12-18 12:06:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15143 to 15143. [2019-12-18 12:06:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15143 states. [2019-12-18 12:06:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15143 states to 15143 states and 47024 transitions. [2019-12-18 12:06:12,834 INFO L78 Accepts]: Start accepts. Automaton has 15143 states and 47024 transitions. Word has length 41 [2019-12-18 12:06:12,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:12,834 INFO L462 AbstractCegarLoop]: Abstraction has 15143 states and 47024 transitions. [2019-12-18 12:06:12,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:06:12,834 INFO L276 IsEmpty]: Start isEmpty. Operand 15143 states and 47024 transitions. [2019-12-18 12:06:12,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:06:12,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:12,851 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:12,851 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:12,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:12,851 INFO L82 PathProgramCache]: Analyzing trace with hash 628999064, now seen corresponding path program 1 times [2019-12-18 12:06:12,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:12,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717428998] [2019-12-18 12:06:12,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:12,909 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:12,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717428998] [2019-12-18 12:06:12,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:12,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:06:12,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497953850] [2019-12-18 12:06:12,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:06:12,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:12,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:06:12,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:12,912 INFO L87 Difference]: Start difference. First operand 15143 states and 47024 transitions. Second operand 3 states. [2019-12-18 12:06:13,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:13,017 INFO L93 Difference]: Finished difference Result 19655 states and 59985 transitions. [2019-12-18 12:06:13,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:06:13,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:06:13,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:13,050 INFO L225 Difference]: With dead ends: 19655 [2019-12-18 12:06:13,050 INFO L226 Difference]: Without dead ends: 19655 [2019-12-18 12:06:13,051 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:13,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19655 states. [2019-12-18 12:06:13,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19655 to 14961. [2019-12-18 12:06:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14961 states. [2019-12-18 12:06:13,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14961 states to 14961 states and 45870 transitions. [2019-12-18 12:06:13,326 INFO L78 Accepts]: Start accepts. Automaton has 14961 states and 45870 transitions. Word has length 65 [2019-12-18 12:06:13,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:13,327 INFO L462 AbstractCegarLoop]: Abstraction has 14961 states and 45870 transitions. [2019-12-18 12:06:13,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:06:13,327 INFO L276 IsEmpty]: Start isEmpty. Operand 14961 states and 45870 transitions. [2019-12-18 12:06:13,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:06:13,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:13,348 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:13,349 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:13,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:13,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1958678932, now seen corresponding path program 1 times [2019-12-18 12:06:13,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:13,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505644062] [2019-12-18 12:06:13,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:13,601 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:13,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505644062] [2019-12-18 12:06:13,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:13,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:06:13,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461631711] [2019-12-18 12:06:13,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:06:13,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:13,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:06:13,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:06:13,604 INFO L87 Difference]: Start difference. First operand 14961 states and 45870 transitions. Second operand 7 states. [2019-12-18 12:06:14,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:14,149 INFO L93 Difference]: Finished difference Result 43069 states and 131367 transitions. [2019-12-18 12:06:14,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:06:14,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:06:14,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:14,194 INFO L225 Difference]: With dead ends: 43069 [2019-12-18 12:06:14,194 INFO L226 Difference]: Without dead ends: 33469 [2019-12-18 12:06:14,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:06:14,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33469 states. [2019-12-18 12:06:14,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33469 to 18596. [2019-12-18 12:06:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18596 states. [2019-12-18 12:06:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18596 states to 18596 states and 57138 transitions. [2019-12-18 12:06:14,585 INFO L78 Accepts]: Start accepts. Automaton has 18596 states and 57138 transitions. Word has length 65 [2019-12-18 12:06:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:14,585 INFO L462 AbstractCegarLoop]: Abstraction has 18596 states and 57138 transitions. [2019-12-18 12:06:14,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:06:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 18596 states and 57138 transitions. [2019-12-18 12:06:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:06:14,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:14,608 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:14,609 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:14,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:14,609 INFO L82 PathProgramCache]: Analyzing trace with hash -29541862, now seen corresponding path program 2 times [2019-12-18 12:06:14,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:14,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563146437] [2019-12-18 12:06:14,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:14,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563146437] [2019-12-18 12:06:14,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:14,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:06:14,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468775253] [2019-12-18 12:06:14,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:06:14,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:14,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:06:14,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:06:14,717 INFO L87 Difference]: Start difference. First operand 18596 states and 57138 transitions. Second operand 7 states. [2019-12-18 12:06:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:15,187 INFO L93 Difference]: Finished difference Result 48601 states and 146797 transitions. [2019-12-18 12:06:15,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:06:15,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:06:15,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:15,246 INFO L225 Difference]: With dead ends: 48601 [2019-12-18 12:06:15,246 INFO L226 Difference]: Without dead ends: 35759 [2019-12-18 12:06:15,246 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:15,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35759 states. [2019-12-18 12:06:15,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35759 to 21981. [2019-12-18 12:06:15,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21981 states. [2019-12-18 12:06:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21981 states to 21981 states and 67224 transitions. [2019-12-18 12:06:15,696 INFO L78 Accepts]: Start accepts. Automaton has 21981 states and 67224 transitions. Word has length 65 [2019-12-18 12:06:15,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:15,696 INFO L462 AbstractCegarLoop]: Abstraction has 21981 states and 67224 transitions. [2019-12-18 12:06:15,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:06:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 21981 states and 67224 transitions. [2019-12-18 12:06:15,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:06:15,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,721 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:15,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:15,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1604322860, now seen corresponding path program 3 times [2019-12-18 12:06:15,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:15,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778571464] [2019-12-18 12:06:15,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:15,842 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:15,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778571464] [2019-12-18 12:06:15,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:15,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:06:15,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678279899] [2019-12-18 12:06:15,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:06:15,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:15,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:06:15,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:06:15,844 INFO L87 Difference]: Start difference. First operand 21981 states and 67224 transitions. Second operand 9 states. [2019-12-18 12:06:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:17,232 INFO L93 Difference]: Finished difference Result 65932 states and 199427 transitions. [2019-12-18 12:06:17,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:06:17,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:06:17,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:17,323 INFO L225 Difference]: With dead ends: 65932 [2019-12-18 12:06:17,323 INFO L226 Difference]: Without dead ends: 63310 [2019-12-18 12:06:17,324 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:17,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63310 states. [2019-12-18 12:06:18,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63310 to 22137. [2019-12-18 12:06:18,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22137 states. [2019-12-18 12:06:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22137 states to 22137 states and 67886 transitions. [2019-12-18 12:06:18,157 INFO L78 Accepts]: Start accepts. Automaton has 22137 states and 67886 transitions. Word has length 65 [2019-12-18 12:06:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:18,157 INFO L462 AbstractCegarLoop]: Abstraction has 22137 states and 67886 transitions. [2019-12-18 12:06:18,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:06:18,157 INFO L276 IsEmpty]: Start isEmpty. Operand 22137 states and 67886 transitions. [2019-12-18 12:06:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:06:18,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:18,179 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:18,179 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:18,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:18,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2017880016, now seen corresponding path program 4 times [2019-12-18 12:06:18,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:18,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410092293] [2019-12-18 12:06:18,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:18,295 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:18,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410092293] [2019-12-18 12:06:18,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:18,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:06:18,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929614071] [2019-12-18 12:06:18,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:06:18,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:18,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:06:18,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:06:18,298 INFO L87 Difference]: Start difference. First operand 22137 states and 67886 transitions. Second operand 9 states. [2019-12-18 12:06:19,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:19,783 INFO L93 Difference]: Finished difference Result 78329 states and 236465 transitions. [2019-12-18 12:06:19,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:06:19,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:06:19,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:19,893 INFO L225 Difference]: With dead ends: 78329 [2019-12-18 12:06:19,893 INFO L226 Difference]: Without dead ends: 75771 [2019-12-18 12:06:19,894 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:20,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75771 states. [2019-12-18 12:06:20,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75771 to 22174. [2019-12-18 12:06:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22174 states. [2019-12-18 12:06:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22174 states to 22174 states and 68084 transitions. [2019-12-18 12:06:20,643 INFO L78 Accepts]: Start accepts. Automaton has 22174 states and 68084 transitions. Word has length 65 [2019-12-18 12:06:20,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:20,643 INFO L462 AbstractCegarLoop]: Abstraction has 22174 states and 68084 transitions. [2019-12-18 12:06:20,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:06:20,643 INFO L276 IsEmpty]: Start isEmpty. Operand 22174 states and 68084 transitions. [2019-12-18 12:06:20,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:06:20,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:20,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] [2019-12-18 12:06:20,665 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:20,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:20,666 INFO L82 PathProgramCache]: Analyzing trace with hash -841108452, now seen corresponding path program 5 times [2019-12-18 12:06:20,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:20,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047474791] [2019-12-18 12:06:20,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:20,733 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:20,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047474791] [2019-12-18 12:06:20,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:20,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:06:20,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626211340] [2019-12-18 12:06:20,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:06:20,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:20,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:06:20,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:20,738 INFO L87 Difference]: Start difference. First operand 22174 states and 68084 transitions. Second operand 3 states. [2019-12-18 12:06:20,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:20,858 INFO L93 Difference]: Finished difference Result 25241 states and 77567 transitions. [2019-12-18 12:06:20,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:06:20,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:06:20,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:20,892 INFO L225 Difference]: With dead ends: 25241 [2019-12-18 12:06:20,892 INFO L226 Difference]: Without dead ends: 25241 [2019-12-18 12:06:20,893 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:21,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25241 states. [2019-12-18 12:06:21,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25241 to 21050. [2019-12-18 12:06:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21050 states. [2019-12-18 12:06:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21050 states to 21050 states and 65371 transitions. [2019-12-18 12:06:21,352 INFO L78 Accepts]: Start accepts. Automaton has 21050 states and 65371 transitions. Word has length 65 [2019-12-18 12:06:21,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:21,352 INFO L462 AbstractCegarLoop]: Abstraction has 21050 states and 65371 transitions. [2019-12-18 12:06:21,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:06:21,352 INFO L276 IsEmpty]: Start isEmpty. Operand 21050 states and 65371 transitions. [2019-12-18 12:06:21,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:06:21,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:21,373 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:21,373 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:21,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:21,374 INFO L82 PathProgramCache]: Analyzing trace with hash -23971085, now seen corresponding path program 1 times [2019-12-18 12:06:21,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:21,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347062252] [2019-12-18 12:06:21,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:21,468 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:21,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347062252] [2019-12-18 12:06:21,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:21,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:06:21,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860109165] [2019-12-18 12:06:21,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:06:21,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:21,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:06:21,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:06:21,470 INFO L87 Difference]: Start difference. First operand 21050 states and 65371 transitions. Second operand 8 states. [2019-12-18 12:06:22,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:22,338 INFO L93 Difference]: Finished difference Result 52001 states and 158465 transitions. [2019-12-18 12:06:22,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:06:22,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 12:06:22,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:22,413 INFO L225 Difference]: With dead ends: 52001 [2019-12-18 12:06:22,413 INFO L226 Difference]: Without dead ends: 48845 [2019-12-18 12:06:22,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:06:22,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48845 states. [2019-12-18 12:06:22,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48845 to 21134. [2019-12-18 12:06:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21134 states. [2019-12-18 12:06:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21134 states to 21134 states and 65711 transitions. [2019-12-18 12:06:22,934 INFO L78 Accepts]: Start accepts. Automaton has 21134 states and 65711 transitions. Word has length 66 [2019-12-18 12:06:22,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:22,935 INFO L462 AbstractCegarLoop]: Abstraction has 21134 states and 65711 transitions. [2019-12-18 12:06:22,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:06:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 21134 states and 65711 transitions. [2019-12-18 12:06:22,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:06:22,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:22,961 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:22,961 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:22,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:22,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1713623309, now seen corresponding path program 2 times [2019-12-18 12:06:22,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:22,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760296154] [2019-12-18 12:06:22,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:23,077 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:23,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760296154] [2019-12-18 12:06:23,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:23,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:06:23,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322079959] [2019-12-18 12:06:23,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:06:23,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:23,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:06:23,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:06:23,079 INFO L87 Difference]: Start difference. First operand 21134 states and 65711 transitions. Second operand 9 states. [2019-12-18 12:06:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:24,378 INFO L93 Difference]: Finished difference Result 59225 states and 178920 transitions. [2019-12-18 12:06:24,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:06:24,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:06:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:24,482 INFO L225 Difference]: With dead ends: 59225 [2019-12-18 12:06:24,482 INFO L226 Difference]: Without dead ends: 56069 [2019-12-18 12:06:24,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:06:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56069 states. [2019-12-18 12:06:25,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56069 to 21156. [2019-12-18 12:06:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21156 states. [2019-12-18 12:06:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21156 states to 21156 states and 65782 transitions. [2019-12-18 12:06:25,289 INFO L78 Accepts]: Start accepts. Automaton has 21156 states and 65782 transitions. Word has length 66 [2019-12-18 12:06:25,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:25,290 INFO L462 AbstractCegarLoop]: Abstraction has 21156 states and 65782 transitions. [2019-12-18 12:06:25,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:06:25,290 INFO L276 IsEmpty]: Start isEmpty. Operand 21156 states and 65782 transitions. [2019-12-18 12:06:25,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:06:25,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:25,311 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:25,311 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:06:25,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:25,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1583227917, now seen corresponding path program 3 times [2019-12-18 12:06:25,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:25,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619133035] [2019-12-18 12:06:25,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:25,430 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:25,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619133035] [2019-12-18 12:06:25,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:25,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:06:25,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972639632] [2019-12-18 12:06:25,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:06:25,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:25,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:06:25,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:06:25,432 INFO L87 Difference]: Start difference. First operand 21156 states and 65782 transitions. Second operand 9 states. [2019-12-18 12:06:26,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:26,720 INFO L93 Difference]: Finished difference Result 65701 states and 198070 transitions. [2019-12-18 12:06:26,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:06:26,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:06:26,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:26,801 INFO L225 Difference]: With dead ends: 65701 [2019-12-18 12:06:26,801 INFO L226 Difference]: Without dead ends: 62568 [2019-12-18 12:06:26,801 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:06:26,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62568 states. [2019-12-18 12:06:27,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62568 to 21037. [2019-12-18 12:06:27,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21037 states. [2019-12-18 12:06:27,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21037 states to 21037 states and 65199 transitions. [2019-12-18 12:06:27,396 INFO L78 Accepts]: Start accepts. Automaton has 21037 states and 65199 transitions. Word has length 66 [2019-12-18 12:06:27,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:27,397 INFO L462 AbstractCegarLoop]: Abstraction has 21037 states and 65199 transitions. [2019-12-18 12:06:27,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:06:27,397 INFO L276 IsEmpty]: Start isEmpty. Operand 21037 states and 65199 transitions. [2019-12-18 12:06:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:06:27,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:27,420 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:27,420 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:06:27,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:27,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1805047887, now seen corresponding path program 4 times [2019-12-18 12:06:27,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:27,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506772597] [2019-12-18 12:06:27,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:27,539 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:27,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506772597] [2019-12-18 12:06:27,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:27,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:06:27,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159096311] [2019-12-18 12:06:27,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:06:27,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:27,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:06:27,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:06:27,546 INFO L87 Difference]: Start difference. First operand 21037 states and 65199 transitions. Second operand 7 states. [2019-12-18 12:06:28,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:28,580 INFO L93 Difference]: Finished difference Result 34009 states and 103933 transitions. [2019-12-18 12:06:28,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:06:28,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 12:06:28,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:28,625 INFO L225 Difference]: With dead ends: 34009 [2019-12-18 12:06:28,626 INFO L226 Difference]: Without dead ends: 34009 [2019-12-18 12:06:28,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:06:28,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34009 states. [2019-12-18 12:06:28,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34009 to 20541. [2019-12-18 12:06:28,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20541 states. [2019-12-18 12:06:29,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20541 states to 20541 states and 62805 transitions. [2019-12-18 12:06:29,017 INFO L78 Accepts]: Start accepts. Automaton has 20541 states and 62805 transitions. Word has length 66 [2019-12-18 12:06:29,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:29,017 INFO L462 AbstractCegarLoop]: Abstraction has 20541 states and 62805 transitions. [2019-12-18 12:06:29,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:06:29,017 INFO L276 IsEmpty]: Start isEmpty. Operand 20541 states and 62805 transitions. [2019-12-18 12:06:29,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:06:29,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:29,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,040 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:06:29,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:29,041 INFO L82 PathProgramCache]: Analyzing trace with hash -707932787, now seen corresponding path program 1 times [2019-12-18 12:06:29,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:29,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231422338] [2019-12-18 12:06:29,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:29,121 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:29,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231422338] [2019-12-18 12:06:29,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:29,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:06:29,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216096875] [2019-12-18 12:06:29,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:06:29,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:29,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:06:29,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:06:29,123 INFO L87 Difference]: Start difference. First operand 20541 states and 62805 transitions. Second operand 4 states. [2019-12-18 12:06:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:29,242 INFO L93 Difference]: Finished difference Result 20356 states and 62069 transitions. [2019-12-18 12:06:29,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:06:29,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 12:06:29,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:29,268 INFO L225 Difference]: With dead ends: 20356 [2019-12-18 12:06:29,268 INFO L226 Difference]: Without dead ends: 20356 [2019-12-18 12:06:29,269 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:06:29,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20356 states. [2019-12-18 12:06:29,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20356 to 18661. [2019-12-18 12:06:29,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18661 states. [2019-12-18 12:06:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18661 states to 18661 states and 56977 transitions. [2019-12-18 12:06:29,671 INFO L78 Accepts]: Start accepts. Automaton has 18661 states and 56977 transitions. Word has length 66 [2019-12-18 12:06:29,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:29,672 INFO L462 AbstractCegarLoop]: Abstraction has 18661 states and 56977 transitions. [2019-12-18 12:06:29,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:06:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 18661 states and 56977 transitions. [2019-12-18 12:06:29,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:06:29,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:29,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,693 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:06:29,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:29,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1506873112, now seen corresponding path program 1 times [2019-12-18 12:06:29,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:29,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26501052] [2019-12-18 12:06:29,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:29,751 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:29,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26501052] [2019-12-18 12:06:29,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:29,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:06:29,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649905982] [2019-12-18 12:06:29,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:06:29,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:29,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:06:29,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:06:29,752 INFO L87 Difference]: Start difference. First operand 18661 states and 56977 transitions. Second operand 3 states. [2019-12-18 12:06:29,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:29,823 INFO L93 Difference]: Finished difference Result 16282 states and 48748 transitions. [2019-12-18 12:06:29,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:06:29,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:06:29,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:29,849 INFO L225 Difference]: With dead ends: 16282 [2019-12-18 12:06:29,850 INFO L226 Difference]: Without dead ends: 16282 [2019-12-18 12:06:29,850 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:29,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16282 states. [2019-12-18 12:06:30,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16282 to 14812. [2019-12-18 12:06:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14812 states. [2019-12-18 12:06:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14812 states to 14812 states and 44338 transitions. [2019-12-18 12:06:30,092 INFO L78 Accepts]: Start accepts. Automaton has 14812 states and 44338 transitions. Word has length 66 [2019-12-18 12:06:30,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:30,092 INFO L462 AbstractCegarLoop]: Abstraction has 14812 states and 44338 transitions. [2019-12-18 12:06:30,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:06:30,093 INFO L276 IsEmpty]: Start isEmpty. Operand 14812 states and 44338 transitions. [2019-12-18 12:06:30,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:06:30,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:30,107 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:06:30,107 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:06:30,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:30,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1717710349, now seen corresponding path program 1 times [2019-12-18 12:06:30,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:30,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744505690] [2019-12-18 12:06:30,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:30,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744505690] [2019-12-18 12:06:30,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:30,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:06:30,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342584371] [2019-12-18 12:06:30,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:06:30,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:30,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:06:30,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:06:30,215 INFO L87 Difference]: Start difference. First operand 14812 states and 44338 transitions. Second operand 9 states. [2019-12-18 12:06:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:31,720 INFO L93 Difference]: Finished difference Result 28534 states and 84444 transitions. [2019-12-18 12:06:31,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:06:31,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 12:06:31,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:31,751 INFO L225 Difference]: With dead ends: 28534 [2019-12-18 12:06:31,751 INFO L226 Difference]: Without dead ends: 23737 [2019-12-18 12:06:31,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:06:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23737 states. [2019-12-18 12:06:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23737 to 15236. [2019-12-18 12:06:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15236 states. [2019-12-18 12:06:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15236 states to 15236 states and 45320 transitions. [2019-12-18 12:06:32,040 INFO L78 Accepts]: Start accepts. Automaton has 15236 states and 45320 transitions. Word has length 67 [2019-12-18 12:06:32,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:32,040 INFO L462 AbstractCegarLoop]: Abstraction has 15236 states and 45320 transitions. [2019-12-18 12:06:32,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:06:32,040 INFO L276 IsEmpty]: Start isEmpty. Operand 15236 states and 45320 transitions. [2019-12-18 12:06:32,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:06:32,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:32,056 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:06:32,056 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:06:32,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:32,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1715738515, now seen corresponding path program 2 times [2019-12-18 12:06:32,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:32,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243128699] [2019-12-18 12:06:32,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:32,221 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:32,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243128699] [2019-12-18 12:06:32,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:32,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:06:32,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454775914] [2019-12-18 12:06:32,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:06:32,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:32,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:06:32,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:06:32,223 INFO L87 Difference]: Start difference. First operand 15236 states and 45320 transitions. Second operand 11 states. [2019-12-18 12:06:33,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:33,427 INFO L93 Difference]: Finished difference Result 19741 states and 58210 transitions. [2019-12-18 12:06:33,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:06:33,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:06:33,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:33,454 INFO L225 Difference]: With dead ends: 19741 [2019-12-18 12:06:33,454 INFO L226 Difference]: Without dead ends: 18186 [2019-12-18 12:06:33,454 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:06:33,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18186 states. [2019-12-18 12:06:33,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18186 to 15329. [2019-12-18 12:06:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15329 states. [2019-12-18 12:06:33,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15329 states to 15329 states and 45551 transitions. [2019-12-18 12:06:33,704 INFO L78 Accepts]: Start accepts. Automaton has 15329 states and 45551 transitions. Word has length 67 [2019-12-18 12:06:33,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:33,704 INFO L462 AbstractCegarLoop]: Abstraction has 15329 states and 45551 transitions. [2019-12-18 12:06:33,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:06:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 15329 states and 45551 transitions. [2019-12-18 12:06:33,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:06:33,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:33,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:06:33,719 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:06:33,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:33,720 INFO L82 PathProgramCache]: Analyzing trace with hash -809344243, now seen corresponding path program 3 times [2019-12-18 12:06:33,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:33,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354853062] [2019-12-18 12:06:33,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:33,900 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:33,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354853062] [2019-12-18 12:06:33,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:33,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:06:33,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881784348] [2019-12-18 12:06:33,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:06:33,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:33,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:06:33,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:06:33,902 INFO L87 Difference]: Start difference. First operand 15329 states and 45551 transitions. Second operand 11 states. [2019-12-18 12:06:34,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:34,934 INFO L93 Difference]: Finished difference Result 31579 states and 93514 transitions. [2019-12-18 12:06:34,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 12:06:34,934 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:06:34,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:34,970 INFO L225 Difference]: With dead ends: 31579 [2019-12-18 12:06:34,970 INFO L226 Difference]: Without dead ends: 29664 [2019-12-18 12:06:34,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 12:06:35,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29664 states. [2019-12-18 12:06:35,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29664 to 17163. [2019-12-18 12:06:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17163 states. [2019-12-18 12:06:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17163 states to 17163 states and 50886 transitions. [2019-12-18 12:06:35,382 INFO L78 Accepts]: Start accepts. Automaton has 17163 states and 50886 transitions. Word has length 67 [2019-12-18 12:06:35,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:35,382 INFO L462 AbstractCegarLoop]: Abstraction has 17163 states and 50886 transitions. [2019-12-18 12:06:35,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:06:35,382 INFO L276 IsEmpty]: Start isEmpty. Operand 17163 states and 50886 transitions. [2019-12-18 12:06:35,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:06:35,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:35,398 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:06:35,398 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:06:35,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:35,398 INFO L82 PathProgramCache]: Analyzing trace with hash -900170963, now seen corresponding path program 4 times [2019-12-18 12:06:35,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:35,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045953478] [2019-12-18 12:06:35,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:35,545 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:35,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045953478] [2019-12-18 12:06:35,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:35,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:06:35,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185679156] [2019-12-18 12:06:35,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:06:35,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:35,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:06:35,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:06:35,547 INFO L87 Difference]: Start difference. First operand 17163 states and 50886 transitions. Second operand 11 states. [2019-12-18 12:06:36,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:36,422 INFO L93 Difference]: Finished difference Result 30198 states and 88900 transitions. [2019-12-18 12:06:36,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:06:36,422 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:06:36,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:36,455 INFO L225 Difference]: With dead ends: 30198 [2019-12-18 12:06:36,455 INFO L226 Difference]: Without dead ends: 25833 [2019-12-18 12:06:36,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:06:36,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25833 states. [2019-12-18 12:06:36,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25833 to 14572. [2019-12-18 12:06:36,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14572 states. [2019-12-18 12:06:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14572 states to 14572 states and 43306 transitions. [2019-12-18 12:06:36,731 INFO L78 Accepts]: Start accepts. Automaton has 14572 states and 43306 transitions. Word has length 67 [2019-12-18 12:06:36,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:36,731 INFO L462 AbstractCegarLoop]: Abstraction has 14572 states and 43306 transitions. [2019-12-18 12:06:36,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:06:36,731 INFO L276 IsEmpty]: Start isEmpty. Operand 14572 states and 43306 transitions. [2019-12-18 12:06:36,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:06:36,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:36,744 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:06:36,745 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:06:36,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:36,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1475658587, now seen corresponding path program 5 times [2019-12-18 12:06:36,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:36,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669152457] [2019-12-18 12:06:36,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:06:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:06:36,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669152457] [2019-12-18 12:06:36,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:06:36,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:06:36,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496640082] [2019-12-18 12:06:36,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:06:36,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:06:36,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:06:36,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:06:36,874 INFO L87 Difference]: Start difference. First operand 14572 states and 43306 transitions. Second operand 11 states. [2019-12-18 12:06:37,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:06:37,679 INFO L93 Difference]: Finished difference Result 25811 states and 76249 transitions. [2019-12-18 12:06:37,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:06:37,680 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:06:37,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:06:37,713 INFO L225 Difference]: With dead ends: 25811 [2019-12-18 12:06:37,713 INFO L226 Difference]: Without dead ends: 25596 [2019-12-18 12:06:37,714 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:06:37,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25596 states. [2019-12-18 12:06:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25596 to 14396. [2019-12-18 12:06:37,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14396 states. [2019-12-18 12:06:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14396 states to 14396 states and 42822 transitions. [2019-12-18 12:06:37,987 INFO L78 Accepts]: Start accepts. Automaton has 14396 states and 42822 transitions. Word has length 67 [2019-12-18 12:06:37,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:06:37,988 INFO L462 AbstractCegarLoop]: Abstraction has 14396 states and 42822 transitions. [2019-12-18 12:06:37,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:06:37,988 INFO L276 IsEmpty]: Start isEmpty. Operand 14396 states and 42822 transitions. [2019-12-18 12:06:38,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:06:38,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:06:38,001 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:06:38,001 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:06:38,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:06:38,002 INFO L82 PathProgramCache]: Analyzing trace with hash -200373485, now seen corresponding path program 6 times [2019-12-18 12:06:38,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:06:38,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493376916] [2019-12-18 12:06:38,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:06:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:06:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:06:38,155 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:06:38,155 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:06:38,159 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) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t38~0.base_23| 1)) (= 0 v_~a$r_buff0_thd1~0_147) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= 0 v_~a$w_buff0_used~0_862) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t38~0.base_23| 4)) (= v_~__unbuffered_p0_EBX~0_60 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t38~0.base_23|) (= 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) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t38~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t38~0.base_23|) |v_ULTIMATE.start_main_~#t38~0.offset_18| 0)) |v_#memory_int_21|) (= 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|) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$w_buff0~0_390 0) (= 0 v_~a$r_buff0_thd2~0_104) (= (select .cse0 |v_ULTIMATE.start_main_~#t38~0.base_23|) 0) (= 0 |v_ULTIMATE.start_main_~#t38~0.offset_18|) (= 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) (= 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_~#t40~0.base=|v_ULTIMATE.start_main_~#t40~0.base_20|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__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, ULTIMATE.start_main_~#t40~0.offset=|v_ULTIMATE.start_main_~#t40~0.offset_15|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_147, ULTIMATE.start_main_~#t38~0.offset=|v_ULTIMATE.start_main_~#t38~0.offset_18|, ~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, ULTIMATE.start_main_~#t39~0.offset=|v_ULTIMATE.start_main_~#t39~0.offset_18|, ~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|, ~a$mem_tmp~0=v_~a$mem_tmp~0_13, ULTIMATE.start_main_~#t39~0.base=|v_ULTIMATE.start_main_~#t39~0.base_23|, 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, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_314, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #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|, ULTIMATE.start_main_~#t38~0.base=|v_ULTIMATE.start_main_~#t38~0.base_23|, ~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_~#t40~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ULTIMATE.start_main_~#t40~0.offset, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t38~0.offset, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t39~0.offset, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_~#t39~0.base, 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, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t38~0.base, ~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:06:38,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] P0ENTRY-->L4-3: Formula: (and (= 1 ~a$w_buff0_used~0_Out65946662) (= (mod ~a$w_buff1_used~0_Out65946662 256) 0) (= |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out65946662| 1) (= |P0Thread1of1ForFork2_#in~arg.base_In65946662| P0Thread1of1ForFork2_~arg.base_Out65946662) (= ~a$w_buff0_used~0_In65946662 ~a$w_buff1_used~0_Out65946662) (= ~a$w_buff0~0_In65946662 ~a$w_buff1~0_Out65946662) (= P0Thread1of1ForFork2_~arg.offset_Out65946662 |P0Thread1of1ForFork2_#in~arg.offset_In65946662|) (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out65946662 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out65946662|) (= 1 ~a$w_buff0~0_Out65946662)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In65946662|, ~a$w_buff0~0=~a$w_buff0~0_In65946662, ~a$w_buff0_used~0=~a$w_buff0_used~0_In65946662, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In65946662|} OutVars{~a$w_buff1~0=~a$w_buff1~0_Out65946662, P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In65946662|, ~a$w_buff0~0=~a$w_buff0~0_Out65946662, P0Thread1of1ForFork2_~arg.offset=P0Thread1of1ForFork2_~arg.offset_Out65946662, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out65946662, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out65946662, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In65946662|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out65946662, P0Thread1of1ForFork2_~arg.base=P0Thread1of1ForFork2_~arg.base_Out65946662, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out65946662|} 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:06:38,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L842-1-->L844: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t39~0.base_13| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t39~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t39~0.base_13|) |v_ULTIMATE.start_main_~#t39~0.offset_11| 1)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t39~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t39~0.base_13|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t39~0.base_13|) 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t39~0.base_13| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t39~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t39~0.offset=|v_ULTIMATE.start_main_~#t39~0.offset_11|, ULTIMATE.start_main_~#t39~0.base=|v_ULTIMATE.start_main_~#t39~0.base_13|, #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|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t39~0.offset, ULTIMATE.start_main_~#t39~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 12:06:38,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L783-2-->L783-5: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1452727224 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1452727224 256))) (.cse2 (= |P1Thread1of1ForFork0_#t~ite10_Out-1452727224| |P1Thread1of1ForFork0_#t~ite9_Out-1452727224|))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In-1452727224 |P1Thread1of1ForFork0_#t~ite9_Out-1452727224|) .cse2) (and (or .cse0 .cse1) (= ~a~0_In-1452727224 |P1Thread1of1ForFork0_#t~ite9_Out-1452727224|) .cse2))) InVars {~a~0=~a~0_In-1452727224, ~a$w_buff1~0=~a$w_buff1~0_In-1452727224, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1452727224, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1452727224} OutVars{~a~0=~a~0_In-1452727224, ~a$w_buff1~0=~a$w_buff1~0_In-1452727224, P1Thread1of1ForFork0_#t~ite10=|P1Thread1of1ForFork0_#t~ite10_Out-1452727224|, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1452727224, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out-1452727224|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1452727224} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-18 12:06:38,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1827789519 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1827789519 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite11_Out-1827789519| ~a$w_buff0_used~0_In-1827789519) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite11_Out-1827789519| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1827789519, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1827789519} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1827789519, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-1827789519|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1827789519} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 12:06:38,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-641039900 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-641039900 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-641039900 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-641039900 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite12_Out-641039900| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In-641039900 |P1Thread1of1ForFork0_#t~ite12_Out-641039900|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-641039900, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-641039900, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-641039900, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-641039900} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-641039900, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-641039900, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out-641039900|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-641039900, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-641039900} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 12:06:38,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-1169114789 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1169114789 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite13_Out-1169114789| ~a$r_buff0_thd2~0_In-1169114789) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite13_Out-1169114789| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1169114789, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1169114789} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1169114789, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1169114789, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out-1169114789|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 12:06:38,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L787-->L787-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In2041073950 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In2041073950 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In2041073950 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In2041073950 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite14_Out2041073950| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite14_Out2041073950| ~a$r_buff1_thd2~0_In2041073950)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2041073950, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2041073950, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2041073950, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2041073950} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2041073950, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2041073950, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2041073950, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out2041073950|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2041073950} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 12:06:38,169 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:06:38,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L844-1-->L846: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t40~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t40~0.base_12|) |v_ULTIMATE.start_main_~#t40~0.offset_10| 2))) (not (= |v_ULTIMATE.start_main_~#t40~0.base_12| 0)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t40~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t40~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t40~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t40~0.base_12| 4) |v_#length_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t40~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|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t40~0.base=|v_ULTIMATE.start_main_~#t40~0.base_12|, ULTIMATE.start_main_~#t40~0.offset=|v_ULTIMATE.start_main_~#t40~0.offset_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t40~0.base, ULTIMATE.start_main_~#t40~0.offset, #length] because there is no mapped edge [2019-12-18 12:06:38,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-77993437 256)))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-77993437 256)))) (or (and .cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-77993437 256))) (= 0 (mod ~a$w_buff0_used~0_In-77993437 256)) (and .cse0 (= 0 (mod ~a$w_buff1_used~0_In-77993437 256))))) (= |P2Thread1of1ForFork1_#t~ite21_Out-77993437| |P2Thread1of1ForFork1_#t~ite20_Out-77993437|) .cse1 (= ~a$w_buff0~0_In-77993437 |P2Thread1of1ForFork1_#t~ite20_Out-77993437|)) (and (= |P2Thread1of1ForFork1_#t~ite21_Out-77993437| ~a$w_buff0~0_In-77993437) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite20_In-77993437| |P2Thread1of1ForFork1_#t~ite20_Out-77993437|)))) InVars {P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In-77993437|, ~a$w_buff0~0=~a$w_buff0~0_In-77993437, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-77993437, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-77993437, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-77993437, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-77993437, ~weak$$choice2~0=~weak$$choice2~0_In-77993437} OutVars{P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out-77993437|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out-77993437|, ~a$w_buff0~0=~a$w_buff0~0_In-77993437, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-77993437, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-77993437, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-77993437, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-77993437, ~weak$$choice2~0=~weak$$choice2~0_In-77993437} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 12:06:38,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In213782841 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite26_In213782841| |P2Thread1of1ForFork1_#t~ite26_Out213782841|) (= |P2Thread1of1ForFork1_#t~ite27_Out213782841| ~a$w_buff0_used~0_In213782841)) (and (= |P2Thread1of1ForFork1_#t~ite26_Out213782841| ~a$w_buff0_used~0_In213782841) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In213782841 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In213782841 256)) (and (= 0 (mod ~a$w_buff1_used~0_In213782841 256)) .cse1) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In213782841 256) 0)))) (= |P2Thread1of1ForFork1_#t~ite27_Out213782841| |P2Thread1of1ForFork1_#t~ite26_Out213782841|)))) InVars {P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In213782841|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In213782841, ~a$w_buff0_used~0=~a$w_buff0_used~0_In213782841, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In213782841, ~a$w_buff1_used~0=~a$w_buff1_used~0_In213782841, ~weak$$choice2~0=~weak$$choice2~0_In213782841} OutVars{P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out213782841|, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out213782841|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In213782841, ~a$w_buff0_used~0=~a$w_buff0_used~0_In213782841, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In213782841, ~a$w_buff1_used~0=~a$w_buff1_used~0_In213782841, ~weak$$choice2~0=~weak$$choice2~0_In213782841} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-18 12:06:38,178 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:06:38,180 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:06:38,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L819-2-->L819-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In-1943631265 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1943631265 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite38_Out-1943631265| ~a$w_buff1~0_In-1943631265)) (and (= |P2Thread1of1ForFork1_#t~ite38_Out-1943631265| ~a~0_In-1943631265) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-1943631265, ~a$w_buff1~0=~a$w_buff1~0_In-1943631265, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1943631265, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1943631265} OutVars{~a~0=~a~0_In-1943631265, P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-1943631265|, ~a$w_buff1~0=~a$w_buff1~0_In-1943631265, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1943631265, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1943631265} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-18 12:06:38,181 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:06:38,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1334961565 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1334961565 256)))) (or (and (= ~a$w_buff0_used~0_In-1334961565 |P2Thread1of1ForFork1_#t~ite40_Out-1334961565|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite40_Out-1334961565|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1334961565, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1334961565} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1334961565, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1334961565, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-1334961565|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-18 12:06:38,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In1293529099 256))) (.cse2 (= (mod ~a$r_buff1_thd3~0_In1293529099 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1293529099 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd3~0_In1293529099 256) 0))) (or (and (= ~a$w_buff1_used~0_In1293529099 |P2Thread1of1ForFork1_#t~ite41_Out1293529099|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite41_Out1293529099|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1293529099, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1293529099, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1293529099, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1293529099} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1293529099, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1293529099, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1293529099, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out1293529099|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1293529099} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-18 12:06:38,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-2021951023 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-2021951023 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite42_Out-2021951023|) (not .cse1)) (and (= ~a$r_buff0_thd3~0_In-2021951023 |P2Thread1of1ForFork1_#t~ite42_Out-2021951023|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2021951023, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2021951023} OutVars{P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-2021951023|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2021951023, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2021951023} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-18 12:06:38,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-531514978 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-531514978 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In-531514978 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-531514978 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite43_Out-531514978|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd3~0_In-531514978 |P2Thread1of1ForFork1_#t~ite43_Out-531514978|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-531514978, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-531514978, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-531514978, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-531514978} OutVars{P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-531514978|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-531514978, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-531514978, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-531514978, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-531514978} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-18 12:06:38,185 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:06:38,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In681820426 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In681820426 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In681820426 |P0Thread1of1ForFork2_#t~ite5_Out681820426|)) (and (= 0 |P0Thread1of1ForFork2_#t~ite5_Out681820426|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In681820426, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In681820426} OutVars{P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out681820426|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In681820426, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In681820426} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 12:06:38,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L762-->L762-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1128710905 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In1128710905 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In1128710905 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In1128710905 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite6_Out1128710905| ~a$w_buff1_used~0_In1128710905) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork2_#t~ite6_Out1128710905| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1128710905, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1128710905, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1128710905, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1128710905} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1128710905, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out1128710905|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1128710905, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1128710905, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1128710905} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 12:06:38,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L763-->L764: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In1785301099 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1785301099 256) 0))) (or (and (not .cse0) (= ~a$r_buff0_thd1~0_Out1785301099 0) (not .cse1)) (and (= ~a$r_buff0_thd1~0_Out1785301099 ~a$r_buff0_thd1~0_In1785301099) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1785301099, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1785301099} OutVars{P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out1785301099|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1785301099, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1785301099} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:06:38,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L764-->L764-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd1~0_In-1589021952 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1589021952 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1589021952 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1589021952 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd1~0_In-1589021952 |P0Thread1of1ForFork2_#t~ite8_Out-1589021952|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork2_#t~ite8_Out-1589021952|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1589021952, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1589021952, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1589021952, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1589021952} OutVars{P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1589021952|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1589021952, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1589021952, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1589021952, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1589021952} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 12:06:38,187 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:06:38,187 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:06:38,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L852-2-->L852-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-856396807 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In-856396807 256) 0))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In-856396807 |ULTIMATE.start_main_#t~ite47_Out-856396807|)) (and (= ~a~0_In-856396807 |ULTIMATE.start_main_#t~ite47_Out-856396807|) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In-856396807, ~a$w_buff1~0=~a$w_buff1~0_In-856396807, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-856396807, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-856396807} OutVars{~a~0=~a~0_In-856396807, ~a$w_buff1~0=~a$w_buff1~0_In-856396807, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-856396807|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-856396807, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-856396807} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:06:38,189 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:06:38,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L853-->L853-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In108714923 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In108714923 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out108714923|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out108714923| ~a$w_buff0_used~0_In108714923) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In108714923, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In108714923} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In108714923, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out108714923|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In108714923} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:06:38,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L854-->L854-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-897108457 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-897108457 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-897108457 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-897108457 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-897108457|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-897108457 |ULTIMATE.start_main_#t~ite50_Out-897108457|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-897108457, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-897108457, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-897108457, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-897108457} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-897108457|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-897108457, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-897108457, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-897108457, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-897108457} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:06:38,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L855-->L855-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1287091474 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-1287091474 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-1287091474| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-1287091474 |ULTIMATE.start_main_#t~ite51_Out-1287091474|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1287091474, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1287091474} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1287091474|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1287091474, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1287091474} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:06:38,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In661091757 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In661091757 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In661091757 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In661091757 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd0~0_In661091757 |ULTIMATE.start_main_#t~ite52_Out661091757|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out661091757|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In661091757, ~a$w_buff0_used~0=~a$w_buff0_used~0_In661091757, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In661091757, ~a$w_buff1_used~0=~a$w_buff1_used~0_In661091757} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out661091757|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In661091757, ~a$w_buff0_used~0=~a$w_buff0_used~0_In661091757, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In661091757, ~a$w_buff1_used~0=~a$w_buff1_used~0_In661091757} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:06:38,192 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:06:38,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:06:38 BasicIcfg [2019-12-18 12:06:38,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:06:38,271 INFO L168 Benchmark]: Toolchain (without parser) took 102169.42 ms. Allocated memory was 146.8 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 102.9 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 12:06:38,272 INFO L168 Benchmark]: CDTParser took 1.25 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 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:06:38,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 888.03 ms. Allocated memory was 146.8 MB in the beginning and 207.6 MB in the end (delta: 60.8 MB). Free memory was 102.5 MB in the beginning and 160.6 MB in the end (delta: -58.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:06:38,273 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.15 ms. Allocated memory is still 207.6 MB. Free memory was 160.6 MB in the beginning and 158.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:06:38,273 INFO L168 Benchmark]: Boogie Preprocessor took 42.89 ms. Allocated memory is still 207.6 MB. Free memory was 158.0 MB in the beginning and 155.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:06:38,273 INFO L168 Benchmark]: RCFGBuilder took 899.00 ms. Allocated memory is still 207.6 MB. Free memory was 155.3 MB in the beginning and 104.3 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:06:38,274 INFO L168 Benchmark]: TraceAbstraction took 100252.78 ms. Allocated memory was 207.6 MB in the beginning and 3.3 GB in the end (delta: 3.0 GB). Free memory was 103.7 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 12:06:38,276 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.25 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 888.03 ms. Allocated memory was 146.8 MB in the beginning and 207.6 MB in the end (delta: 60.8 MB). Free memory was 102.5 MB in the beginning and 160.6 MB in the end (delta: -58.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.15 ms. Allocated memory is still 207.6 MB. Free memory was 160.6 MB in the beginning and 158.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.89 ms. Allocated memory is still 207.6 MB. Free memory was 158.0 MB in the beginning and 155.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 899.00 ms. Allocated memory is still 207.6 MB. Free memory was 155.3 MB in the beginning and 104.3 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 100252.78 ms. Allocated memory was 207.6 MB in the beginning and 3.3 GB in the end (delta: 3.0 GB). Free memory was 103.7 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 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(&t38, ((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(&t39, ((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(&t40, ((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: 99.9s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 29.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7711 SDtfs, 11165 SDslu, 28228 SDs, 0 SdLazy, 10591 SolverSat, 476 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 379 GetRequests, 43 SyntacticMatches, 9 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 3.9s 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: 41.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 365983 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1485 NumberOfCodeBlocks, 1485 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1389 ConstructedInterpolants, 0 QuantifiedInterpolants, 287786 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...