/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:31:39,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:31:39,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:31:40,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:31:40,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:31:40,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:31:40,007 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:31:40,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:31:40,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:31:40,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:31:40,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:31:40,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:31:40,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:31:40,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:31:40,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:31:40,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:31:40,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:31:40,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:31:40,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:31:40,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:31:40,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:31:40,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:31:40,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:31:40,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:31:40,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:31:40,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:31:40,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:31:40,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:31:40,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:31:40,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:31:40,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:31:40,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:31:40,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:31:40,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:31:40,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:31:40,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:31:40,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:31:40,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:31:40,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:31:40,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:31:40,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:31:40,041 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:31:40,055 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:31:40,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:31:40,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:31:40,057 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:31:40,057 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:31:40,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:31:40,057 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:31:40,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:31:40,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:31:40,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:31:40,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:31:40,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:31:40,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:31:40,059 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:31:40,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:31:40,059 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:31:40,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:31:40,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:31:40,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:31:40,060 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:31:40,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:31:40,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:31:40,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:31:40,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:31:40,061 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:31:40,061 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:31:40,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:31:40,062 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:31:40,062 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:31:40,062 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:31:40,062 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:31:40,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:31:40,363 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:31:40,367 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:31:40,368 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:31:40,369 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:31:40,371 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_power.opt.i [2019-12-27 16:31:40,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a8fb3ec5/fe0954cce0ea439d8e21e5711edf7e23/FLAG202f31c60 [2019-12-27 16:31:40,963 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:31:40,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_power.opt.i [2019-12-27 16:31:40,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a8fb3ec5/fe0954cce0ea439d8e21e5711edf7e23/FLAG202f31c60 [2019-12-27 16:31:41,293 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a8fb3ec5/fe0954cce0ea439d8e21e5711edf7e23 [2019-12-27 16:31:41,304 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:31:41,306 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:31:41,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:31:41,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:31:41,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:31:41,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:31:41" (1/1) ... [2019-12-27 16:31:41,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd32435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:41, skipping insertion in model container [2019-12-27 16:31:41,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:31:41" (1/1) ... [2019-12-27 16:31:41,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:31:41,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:31:41,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:31:41,876 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:31:41,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:31:42,030 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:31:42,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:42 WrapperNode [2019-12-27 16:31:42,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:31:42,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:31:42,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:31:42,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:31:42,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:42" (1/1) ... [2019-12-27 16:31:42,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:42" (1/1) ... [2019-12-27 16:31:42,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:31:42,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:31:42,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:31:42,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:31:42,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:42" (1/1) ... [2019-12-27 16:31:42,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:42" (1/1) ... [2019-12-27 16:31:42,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:42" (1/1) ... [2019-12-27 16:31:42,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:42" (1/1) ... [2019-12-27 16:31:42,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:42" (1/1) ... [2019-12-27 16:31:42,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:42" (1/1) ... [2019-12-27 16:31:42,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:42" (1/1) ... [2019-12-27 16:31:42,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:31:42,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:31:42,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:31:42,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:31:42,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:42" (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-27 16:31:42,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:31:42,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:31:42,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:31:42,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:31:42,229 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:31:42,229 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:31:42,229 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:31:42,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:31:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:31:42,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:31:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 16:31:42,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 16:31:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:31:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:31:42,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:31:42,233 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:31:43,020 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:31:43,020 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:31:43,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:31:43 BoogieIcfgContainer [2019-12-27 16:31:43,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:31:43,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:31:43,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:31:43,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:31:43,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:31:41" (1/3) ... [2019-12-27 16:31:43,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b58be93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:31:43, skipping insertion in model container [2019-12-27 16:31:43,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:31:42" (2/3) ... [2019-12-27 16:31:43,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b58be93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:31:43, skipping insertion in model container [2019-12-27 16:31:43,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:31:43" (3/3) ... [2019-12-27 16:31:43,034 INFO L109 eAbstractionObserver]: Analyzing ICFG mix027_power.opt.i [2019-12-27 16:31:43,046 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:31:43,046 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:31:43,064 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:31:43,065 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:31:43,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,129 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,129 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,133 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,134 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,188 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,195 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,195 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,196 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,197 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,204 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,204 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,204 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,205 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,205 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,205 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,205 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,205 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,208 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,208 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,208 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,208 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,208 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,209 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,209 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,209 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,209 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,209 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,210 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,210 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,217 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,217 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,217 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,217 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,217 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,218 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,224 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,224 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,228 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,231 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,234 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,234 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,234 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:31:43,253 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 16:31:43,278 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:31:43,278 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:31:43,278 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:31:43,278 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:31:43,278 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:31:43,279 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:31:43,279 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:31:43,280 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:31:43,300 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-27 16:31:43,301 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 16:31:43,408 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 16:31:43,408 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:31:43,424 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 16:31:43,449 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 16:31:43,506 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 16:31:43,507 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:31:43,514 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 16:31:43,535 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-27 16:31:43,536 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:31:48,846 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 16:31:48,955 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 16:31:49,381 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 16:31:49,525 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 16:31:49,553 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74757 [2019-12-27 16:31:49,554 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 16:31:49,557 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-27 16:32:28,803 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 171250 states. [2019-12-27 16:32:28,805 INFO L276 IsEmpty]: Start isEmpty. Operand 171250 states. [2019-12-27 16:32:28,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 16:32:28,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:32:28,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:32:28,812 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:32:28,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:32:28,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1969539409, now seen corresponding path program 1 times [2019-12-27 16:32:28,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:32:28,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364932282] [2019-12-27 16:32:28,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:32:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:32:29,119 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-27 16:32:29,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364932282] [2019-12-27 16:32:29,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:32:29,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:32:29,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1674157035] [2019-12-27 16:32:29,123 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:32:29,127 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:32:29,141 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 16:32:29,142 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:32:29,146 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:32:29,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:32:29,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:32:29,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:32:29,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:32:29,161 INFO L87 Difference]: Start difference. First operand 171250 states. Second operand 3 states. [2019-12-27 16:32:33,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:32:33,969 INFO L93 Difference]: Finished difference Result 169554 states and 814774 transitions. [2019-12-27 16:32:33,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:32:33,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 16:32:33,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:32:35,112 INFO L225 Difference]: With dead ends: 169554 [2019-12-27 16:32:35,112 INFO L226 Difference]: Without dead ends: 159076 [2019-12-27 16:32:35,114 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-27 16:32:45,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159076 states. [2019-12-27 16:32:49,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159076 to 159076. [2019-12-27 16:32:49,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159076 states. [2019-12-27 16:32:50,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159076 states to 159076 states and 763437 transitions. [2019-12-27 16:32:50,751 INFO L78 Accepts]: Start accepts. Automaton has 159076 states and 763437 transitions. Word has length 7 [2019-12-27 16:32:50,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:32:50,752 INFO L462 AbstractCegarLoop]: Abstraction has 159076 states and 763437 transitions. [2019-12-27 16:32:50,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:32:50,752 INFO L276 IsEmpty]: Start isEmpty. Operand 159076 states and 763437 transitions. [2019-12-27 16:32:50,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 16:32:50,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:32:50,764 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:32:50,765 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:32:50,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:32:50,765 INFO L82 PathProgramCache]: Analyzing trace with hash 230524214, now seen corresponding path program 1 times [2019-12-27 16:32:50,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:32:50,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14065618] [2019-12-27 16:32:50,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:32:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:32:50,916 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-27 16:32:50,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14065618] [2019-12-27 16:32:50,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:32:50,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:32:50,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1865477581] [2019-12-27 16:32:50,918 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:32:50,919 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:32:50,924 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 16:32:50,925 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:32:50,925 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:32:50,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:32:50,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:32:50,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:32:50,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:32:50,927 INFO L87 Difference]: Start difference. First operand 159076 states and 763437 transitions. Second operand 4 states. [2019-12-27 16:32:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:32:58,974 INFO L93 Difference]: Finished difference Result 251868 states and 1162713 transitions. [2019-12-27 16:32:58,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:32:58,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 16:32:58,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:33:00,937 INFO L225 Difference]: With dead ends: 251868 [2019-12-27 16:33:00,937 INFO L226 Difference]: Without dead ends: 251658 [2019-12-27 16:33:00,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:33:15,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251658 states. [2019-12-27 16:33:20,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251658 to 235278. [2019-12-27 16:33:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235278 states. [2019-12-27 16:33:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235278 states to 235278 states and 1094580 transitions. [2019-12-27 16:33:32,316 INFO L78 Accepts]: Start accepts. Automaton has 235278 states and 1094580 transitions. Word has length 15 [2019-12-27 16:33:32,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:33:32,316 INFO L462 AbstractCegarLoop]: Abstraction has 235278 states and 1094580 transitions. [2019-12-27 16:33:32,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:33:32,316 INFO L276 IsEmpty]: Start isEmpty. Operand 235278 states and 1094580 transitions. [2019-12-27 16:33:32,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 16:33:32,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:33:32,321 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:33:32,322 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:33:32,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:33:32,322 INFO L82 PathProgramCache]: Analyzing trace with hash -519494263, now seen corresponding path program 1 times [2019-12-27 16:33:32,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:33:32,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410583392] [2019-12-27 16:33:32,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:33:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:33:32,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-27 16:33:32,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410583392] [2019-12-27 16:33:32,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:33:32,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:33:32,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [490724355] [2019-12-27 16:33:32,399 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:33:32,401 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:33:32,403 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 16:33:32,403 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:33:32,403 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:33:32,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:33:32,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:33:32,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:33:32,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:33:32,404 INFO L87 Difference]: Start difference. First operand 235278 states and 1094580 transitions. Second operand 3 states. [2019-12-27 16:33:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:33:33,207 INFO L93 Difference]: Finished difference Result 146539 states and 614385 transitions. [2019-12-27 16:33:33,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:33:33,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 16:33:33,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:33:33,618 INFO L225 Difference]: With dead ends: 146539 [2019-12-27 16:33:33,618 INFO L226 Difference]: Without dead ends: 146539 [2019-12-27 16:33:33,619 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-27 16:33:39,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146539 states. [2019-12-27 16:33:48,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146539 to 146539. [2019-12-27 16:33:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146539 states. [2019-12-27 16:33:49,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146539 states to 146539 states and 614385 transitions. [2019-12-27 16:33:49,327 INFO L78 Accepts]: Start accepts. Automaton has 146539 states and 614385 transitions. Word has length 15 [2019-12-27 16:33:49,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:33:49,327 INFO L462 AbstractCegarLoop]: Abstraction has 146539 states and 614385 transitions. [2019-12-27 16:33:49,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:33:49,327 INFO L276 IsEmpty]: Start isEmpty. Operand 146539 states and 614385 transitions. [2019-12-27 16:33:49,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:33:49,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:33:49,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:33:49,333 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:33:49,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:33:49,333 INFO L82 PathProgramCache]: Analyzing trace with hash -839885588, now seen corresponding path program 1 times [2019-12-27 16:33:49,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:33:49,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437266663] [2019-12-27 16:33:49,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:33:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:33:49,387 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-27 16:33:49,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437266663] [2019-12-27 16:33:49,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:33:49,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:33:49,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [677838564] [2019-12-27 16:33:49,389 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:33:49,391 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:33:49,393 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 16:33:49,393 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:33:49,429 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:33:49,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:33:49,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:33:49,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:33:49,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:33:49,430 INFO L87 Difference]: Start difference. First operand 146539 states and 614385 transitions. Second operand 5 states. [2019-12-27 16:33:49,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:33:49,648 INFO L93 Difference]: Finished difference Result 40251 states and 143660 transitions. [2019-12-27 16:33:49,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:33:49,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 16:33:49,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:33:50,727 INFO L225 Difference]: With dead ends: 40251 [2019-12-27 16:33:50,727 INFO L226 Difference]: Without dead ends: 40251 [2019-12-27 16:33:50,727 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-27 16:33:50,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40251 states. [2019-12-27 16:33:51,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40251 to 40251. [2019-12-27 16:33:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40251 states. [2019-12-27 16:33:51,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40251 states to 40251 states and 143660 transitions. [2019-12-27 16:33:51,472 INFO L78 Accepts]: Start accepts. Automaton has 40251 states and 143660 transitions. Word has length 16 [2019-12-27 16:33:51,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:33:51,472 INFO L462 AbstractCegarLoop]: Abstraction has 40251 states and 143660 transitions. [2019-12-27 16:33:51,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:33:51,473 INFO L276 IsEmpty]: Start isEmpty. Operand 40251 states and 143660 transitions. [2019-12-27 16:33:51,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:33:51,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:33:51,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:33:51,475 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:33:51,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:33:51,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1627950887, now seen corresponding path program 1 times [2019-12-27 16:33:51,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:33:51,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924715678] [2019-12-27 16:33:51,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:33:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:33:51,614 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-27 16:33:51,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924715678] [2019-12-27 16:33:51,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:33:51,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:33:51,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [127127516] [2019-12-27 16:33:51,615 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:33:51,617 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:33:51,622 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 16:33:51,622 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:33:51,724 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:33:51,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:33:51,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:33:51,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:33:51,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:33:51,726 INFO L87 Difference]: Start difference. First operand 40251 states and 143660 transitions. Second operand 7 states. [2019-12-27 16:33:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:33:52,681 INFO L93 Difference]: Finished difference Result 58215 states and 204121 transitions. [2019-12-27 16:33:52,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:33:52,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-27 16:33:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:33:52,816 INFO L225 Difference]: With dead ends: 58215 [2019-12-27 16:33:52,816 INFO L226 Difference]: Without dead ends: 58197 [2019-12-27 16:33:52,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:33:55,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58197 states. [2019-12-27 16:33:56,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58197 to 46455. [2019-12-27 16:33:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46455 states. [2019-12-27 16:33:56,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46455 states to 46455 states and 165104 transitions. [2019-12-27 16:33:56,523 INFO L78 Accepts]: Start accepts. Automaton has 46455 states and 165104 transitions. Word has length 16 [2019-12-27 16:33:56,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:33:56,524 INFO L462 AbstractCegarLoop]: Abstraction has 46455 states and 165104 transitions. [2019-12-27 16:33:56,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:33:56,524 INFO L276 IsEmpty]: Start isEmpty. Operand 46455 states and 165104 transitions. [2019-12-27 16:33:56,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 16:33:56,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:33:56,544 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] [2019-12-27 16:33:56,544 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:33:56,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:33:56,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1520730132, now seen corresponding path program 1 times [2019-12-27 16:33:56,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:33:56,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206486628] [2019-12-27 16:33:56,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:33:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:33:56,681 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-27 16:33:56,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206486628] [2019-12-27 16:33:56,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:33:56,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:33:56,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1057331272] [2019-12-27 16:33:56,683 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:33:56,686 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:33:56,700 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 100 transitions. [2019-12-27 16:33:56,700 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:33:56,763 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:33:56,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:33:56,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:33:56,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:33:56,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:33:56,765 INFO L87 Difference]: Start difference. First operand 46455 states and 165104 transitions. Second operand 8 states. [2019-12-27 16:33:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:33:59,142 INFO L93 Difference]: Finished difference Result 142716 states and 495019 transitions. [2019-12-27 16:33:59,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 16:33:59,143 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-27 16:33:59,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:33:59,465 INFO L225 Difference]: With dead ends: 142716 [2019-12-27 16:33:59,465 INFO L226 Difference]: Without dead ends: 142663 [2019-12-27 16:33:59,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:33:59,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142663 states. [2019-12-27 16:34:01,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142663 to 69309. [2019-12-27 16:34:01,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69309 states. [2019-12-27 16:34:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69309 states to 69309 states and 246052 transitions. [2019-12-27 16:34:01,822 INFO L78 Accepts]: Start accepts. Automaton has 69309 states and 246052 transitions. Word has length 24 [2019-12-27 16:34:01,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:01,822 INFO L462 AbstractCegarLoop]: Abstraction has 69309 states and 246052 transitions. [2019-12-27 16:34:01,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:34:01,822 INFO L276 IsEmpty]: Start isEmpty. Operand 69309 states and 246052 transitions. [2019-12-27 16:34:01,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 16:34:01,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:01,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:01,846 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:01,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:01,846 INFO L82 PathProgramCache]: Analyzing trace with hash 536202934, now seen corresponding path program 2 times [2019-12-27 16:34:01,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:01,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026679232] [2019-12-27 16:34:01,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:01,962 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-27 16:34:01,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026679232] [2019-12-27 16:34:01,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:01,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:34:01,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1227695305] [2019-12-27 16:34:01,964 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:01,967 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:01,975 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 40 transitions. [2019-12-27 16:34:01,975 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:01,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:34:02,066 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:34:02,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:34:02,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:02,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:34:02,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:34:02,068 INFO L87 Difference]: Start difference. First operand 69309 states and 246052 transitions. Second operand 8 states. [2019-12-27 16:34:04,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:04,252 INFO L93 Difference]: Finished difference Result 103616 states and 358800 transitions. [2019-12-27 16:34:04,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 16:34:04,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-27 16:34:04,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:04,482 INFO L225 Difference]: With dead ends: 103616 [2019-12-27 16:34:04,482 INFO L226 Difference]: Without dead ends: 103594 [2019-12-27 16:34:04,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:34:04,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103594 states. [2019-12-27 16:34:06,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103594 to 62281. [2019-12-27 16:34:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62281 states. [2019-12-27 16:34:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62281 states to 62281 states and 221958 transitions. [2019-12-27 16:34:06,518 INFO L78 Accepts]: Start accepts. Automaton has 62281 states and 221958 transitions. Word has length 24 [2019-12-27 16:34:06,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:06,518 INFO L462 AbstractCegarLoop]: Abstraction has 62281 states and 221958 transitions. [2019-12-27 16:34:06,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:34:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 62281 states and 221958 transitions. [2019-12-27 16:34:06,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:34:06,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:06,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:06,555 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:06,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:06,556 INFO L82 PathProgramCache]: Analyzing trace with hash -560534453, now seen corresponding path program 1 times [2019-12-27 16:34:06,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:06,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438372121] [2019-12-27 16:34:06,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:06,622 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-27 16:34:06,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438372121] [2019-12-27 16:34:06,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:06,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:34:06,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1518666823] [2019-12-27 16:34:06,624 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:06,627 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:06,635 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 40 transitions. [2019-12-27 16:34:06,635 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:06,650 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:34:06,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:34:06,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:06,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:34:06,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:34:06,652 INFO L87 Difference]: Start difference. First operand 62281 states and 221958 transitions. Second operand 6 states. [2019-12-27 16:34:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:06,839 INFO L93 Difference]: Finished difference Result 34860 states and 126226 transitions. [2019-12-27 16:34:06,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:34:06,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 16:34:06,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:06,908 INFO L225 Difference]: With dead ends: 34860 [2019-12-27 16:34:06,908 INFO L226 Difference]: Without dead ends: 34860 [2019-12-27 16:34:06,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:34:07,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34860 states. [2019-12-27 16:34:07,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34860 to 33994. [2019-12-27 16:34:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33994 states. [2019-12-27 16:34:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33994 states to 33994 states and 123179 transitions. [2019-12-27 16:34:08,125 INFO L78 Accepts]: Start accepts. Automaton has 33994 states and 123179 transitions. Word has length 28 [2019-12-27 16:34:08,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:08,125 INFO L462 AbstractCegarLoop]: Abstraction has 33994 states and 123179 transitions. [2019-12-27 16:34:08,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:34:08,126 INFO L276 IsEmpty]: Start isEmpty. Operand 33994 states and 123179 transitions. [2019-12-27 16:34:08,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 16:34:08,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:08,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:08,188 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:08,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:08,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1812552662, now seen corresponding path program 1 times [2019-12-27 16:34:08,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:08,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473936968] [2019-12-27 16:34:08,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:08,306 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-27 16:34:08,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473936968] [2019-12-27 16:34:08,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:08,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:34:08,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [87639576] [2019-12-27 16:34:08,307 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:08,317 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:08,354 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 131 transitions. [2019-12-27 16:34:08,355 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:08,369 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:34:08,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:34:08,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:08,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:34:08,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:34:08,370 INFO L87 Difference]: Start difference. First operand 33994 states and 123179 transitions. Second operand 5 states. [2019-12-27 16:34:08,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:08,669 INFO L93 Difference]: Finished difference Result 49156 states and 170197 transitions. [2019-12-27 16:34:08,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:34:08,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 16:34:08,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:08,770 INFO L225 Difference]: With dead ends: 49156 [2019-12-27 16:34:08,770 INFO L226 Difference]: Without dead ends: 34506 [2019-12-27 16:34:08,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:34:08,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34506 states. [2019-12-27 16:34:09,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34506 to 34228. [2019-12-27 16:34:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34228 states. [2019-12-27 16:34:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34228 states to 34228 states and 122722 transitions. [2019-12-27 16:34:09,387 INFO L78 Accepts]: Start accepts. Automaton has 34228 states and 122722 transitions. Word has length 42 [2019-12-27 16:34:09,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:09,387 INFO L462 AbstractCegarLoop]: Abstraction has 34228 states and 122722 transitions. [2019-12-27 16:34:09,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:34:09,387 INFO L276 IsEmpty]: Start isEmpty. Operand 34228 states and 122722 transitions. [2019-12-27 16:34:09,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 16:34:09,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:09,439 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:09,440 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:09,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:09,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1574516846, now seen corresponding path program 2 times [2019-12-27 16:34:09,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:09,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346915904] [2019-12-27 16:34:09,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:09,526 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-27 16:34:09,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346915904] [2019-12-27 16:34:09,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:09,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:34:09,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [754708212] [2019-12-27 16:34:09,527 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:09,538 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:09,595 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 193 transitions. [2019-12-27 16:34:09,595 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:09,609 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:34:09,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:34:09,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:09,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:34:09,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:34:09,610 INFO L87 Difference]: Start difference. First operand 34228 states and 122722 transitions. Second operand 4 states. [2019-12-27 16:34:10,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:10,238 INFO L93 Difference]: Finished difference Result 58013 states and 200152 transitions. [2019-12-27 16:34:10,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:34:10,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 16:34:10,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:10,316 INFO L225 Difference]: With dead ends: 58013 [2019-12-27 16:34:10,317 INFO L226 Difference]: Without dead ends: 41467 [2019-12-27 16:34:10,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-27 16:34:10,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41467 states. [2019-12-27 16:34:10,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41467 to 32918. [2019-12-27 16:34:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32918 states. [2019-12-27 16:34:10,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32918 states to 32918 states and 103369 transitions. [2019-12-27 16:34:10,940 INFO L78 Accepts]: Start accepts. Automaton has 32918 states and 103369 transitions. Word has length 42 [2019-12-27 16:34:10,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:10,940 INFO L462 AbstractCegarLoop]: Abstraction has 32918 states and 103369 transitions. [2019-12-27 16:34:10,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:34:10,940 INFO L276 IsEmpty]: Start isEmpty. Operand 32918 states and 103369 transitions. [2019-12-27 16:34:10,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 16:34:10,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:10,995 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] [2019-12-27 16:34:10,995 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:10,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:10,995 INFO L82 PathProgramCache]: Analyzing trace with hash 730447546, now seen corresponding path program 1 times [2019-12-27 16:34:10,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:10,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548855215] [2019-12-27 16:34:10,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:11,071 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-27 16:34:11,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548855215] [2019-12-27 16:34:11,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:11,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:34:11,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [553067741] [2019-12-27 16:34:11,072 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:11,086 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:11,147 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 261 transitions. [2019-12-27 16:34:11,148 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:11,176 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:34:11,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:34:11,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:11,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:34:11,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:34:11,177 INFO L87 Difference]: Start difference. First operand 32918 states and 103369 transitions. Second operand 8 states. [2019-12-27 16:34:11,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:11,391 INFO L93 Difference]: Finished difference Result 31435 states and 99570 transitions. [2019-12-27 16:34:11,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:34:11,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-12-27 16:34:11,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:11,413 INFO L225 Difference]: With dead ends: 31435 [2019-12-27 16:34:11,413 INFO L226 Difference]: Without dead ends: 13694 [2019-12-27 16:34:11,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:34:11,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13694 states. [2019-12-27 16:34:11,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13694 to 12694. [2019-12-27 16:34:11,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12694 states. [2019-12-27 16:34:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12694 states to 12694 states and 40149 transitions. [2019-12-27 16:34:11,625 INFO L78 Accepts]: Start accepts. Automaton has 12694 states and 40149 transitions. Word has length 43 [2019-12-27 16:34:11,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:11,625 INFO L462 AbstractCegarLoop]: Abstraction has 12694 states and 40149 transitions. [2019-12-27 16:34:11,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:34:11,625 INFO L276 IsEmpty]: Start isEmpty. Operand 12694 states and 40149 transitions. [2019-12-27 16:34:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:11,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:11,640 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] [2019-12-27 16:34:11,640 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:11,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:11,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1417173482, now seen corresponding path program 1 times [2019-12-27 16:34:11,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:11,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422739079] [2019-12-27 16:34:11,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:11,701 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-27 16:34:11,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422739079] [2019-12-27 16:34:11,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:11,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:34:11,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [987990783] [2019-12-27 16:34:11,702 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:11,816 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:12,133 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 354 states and 625 transitions. [2019-12-27 16:34:12,133 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:12,135 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:34:12,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:34:12,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:12,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:34:12,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:34:12,136 INFO L87 Difference]: Start difference. First operand 12694 states and 40149 transitions. Second operand 3 states. [2019-12-27 16:34:12,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:12,225 INFO L93 Difference]: Finished difference Result 15372 states and 47564 transitions. [2019-12-27 16:34:12,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:34:12,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 16:34:12,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:12,247 INFO L225 Difference]: With dead ends: 15372 [2019-12-27 16:34:12,247 INFO L226 Difference]: Without dead ends: 15372 [2019-12-27 16:34:12,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-27 16:34:12,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15372 states. [2019-12-27 16:34:12,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15372 to 11215. [2019-12-27 16:34:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11215 states. [2019-12-27 16:34:12,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11215 states to 11215 states and 34889 transitions. [2019-12-27 16:34:12,452 INFO L78 Accepts]: Start accepts. Automaton has 11215 states and 34889 transitions. Word has length 57 [2019-12-27 16:34:12,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:12,452 INFO L462 AbstractCegarLoop]: Abstraction has 11215 states and 34889 transitions. [2019-12-27 16:34:12,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:34:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 11215 states and 34889 transitions. [2019-12-27 16:34:12,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:12,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:12,464 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] [2019-12-27 16:34:12,465 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:12,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:12,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1774753707, now seen corresponding path program 1 times [2019-12-27 16:34:12,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:12,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851740459] [2019-12-27 16:34:12,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:12,556 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-27 16:34:12,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851740459] [2019-12-27 16:34:12,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:12,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:34:12,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [328169639] [2019-12-27 16:34:12,557 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:12,576 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:13,040 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 354 states and 625 transitions. [2019-12-27 16:34:13,040 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:13,042 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:34:13,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:34:13,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:13,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:34:13,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:34:13,043 INFO L87 Difference]: Start difference. First operand 11215 states and 34889 transitions. Second operand 7 states. [2019-12-27 16:34:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:13,511 INFO L93 Difference]: Finished difference Result 34317 states and 105832 transitions. [2019-12-27 16:34:13,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:34:13,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 16:34:13,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:13,550 INFO L225 Difference]: With dead ends: 34317 [2019-12-27 16:34:13,550 INFO L226 Difference]: Without dead ends: 25573 [2019-12-27 16:34:13,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 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-27 16:34:13,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25573 states. [2019-12-27 16:34:13,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25573 to 14821. [2019-12-27 16:34:13,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14821 states. [2019-12-27 16:34:13,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14821 states to 14821 states and 46388 transitions. [2019-12-27 16:34:13,880 INFO L78 Accepts]: Start accepts. Automaton has 14821 states and 46388 transitions. Word has length 57 [2019-12-27 16:34:13,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:13,881 INFO L462 AbstractCegarLoop]: Abstraction has 14821 states and 46388 transitions. [2019-12-27 16:34:13,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:34:13,881 INFO L276 IsEmpty]: Start isEmpty. Operand 14821 states and 46388 transitions. [2019-12-27 16:34:13,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:13,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:13,897 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] [2019-12-27 16:34:13,898 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:13,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:13,898 INFO L82 PathProgramCache]: Analyzing trace with hash -70014025, now seen corresponding path program 2 times [2019-12-27 16:34:13,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:13,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407987705] [2019-12-27 16:34:13,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:13,982 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-27 16:34:13,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407987705] [2019-12-27 16:34:13,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:13,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:34:13,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1819104222] [2019-12-27 16:34:13,983 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:14,003 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:14,449 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 350 states and 684 transitions. [2019-12-27 16:34:14,449 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:14,923 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 16:34:14,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:34:14,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:14,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:34:14,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:34:14,924 INFO L87 Difference]: Start difference. First operand 14821 states and 46388 transitions. Second operand 9 states. [2019-12-27 16:34:17,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:17,291 INFO L93 Difference]: Finished difference Result 86558 states and 266074 transitions. [2019-12-27 16:34:17,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 16:34:17,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 16:34:17,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:17,394 INFO L225 Difference]: With dead ends: 86558 [2019-12-27 16:34:17,394 INFO L226 Difference]: Without dead ends: 62022 [2019-12-27 16:34:17,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=320, Invalid=1012, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 16:34:17,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62022 states. [2019-12-27 16:34:18,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62022 to 23426. [2019-12-27 16:34:18,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23426 states. [2019-12-27 16:34:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23426 states to 23426 states and 73779 transitions. [2019-12-27 16:34:18,127 INFO L78 Accepts]: Start accepts. Automaton has 23426 states and 73779 transitions. Word has length 57 [2019-12-27 16:34:18,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:18,128 INFO L462 AbstractCegarLoop]: Abstraction has 23426 states and 73779 transitions. [2019-12-27 16:34:18,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:34:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 23426 states and 73779 transitions. [2019-12-27 16:34:18,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:18,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:18,157 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] [2019-12-27 16:34:18,157 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:18,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:18,157 INFO L82 PathProgramCache]: Analyzing trace with hash -766414125, now seen corresponding path program 3 times [2019-12-27 16:34:18,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:18,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827426380] [2019-12-27 16:34:18,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:18,248 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-27 16:34:18,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827426380] [2019-12-27 16:34:18,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:18,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:34:18,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [667305250] [2019-12-27 16:34:18,249 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:18,290 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:18,818 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 316 states and 595 transitions. [2019-12-27 16:34:18,818 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:19,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 16:34:19,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:34:19,282 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-12-27 16:34:19,313 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 16:34:19,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:34:19,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:19,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:34:19,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:34:19,315 INFO L87 Difference]: Start difference. First operand 23426 states and 73779 transitions. Second operand 12 states. [2019-12-27 16:34:22,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:22,300 INFO L93 Difference]: Finished difference Result 71038 states and 217598 transitions. [2019-12-27 16:34:22,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 16:34:22,300 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-27 16:34:22,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:22,405 INFO L225 Difference]: With dead ends: 71038 [2019-12-27 16:34:22,405 INFO L226 Difference]: Without dead ends: 65932 [2019-12-27 16:34:22,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=213, Invalid=779, Unknown=0, NotChecked=0, Total=992 [2019-12-27 16:34:22,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65932 states. [2019-12-27 16:34:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65932 to 23483. [2019-12-27 16:34:23,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23483 states. [2019-12-27 16:34:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23483 states to 23483 states and 73972 transitions. [2019-12-27 16:34:23,376 INFO L78 Accepts]: Start accepts. Automaton has 23483 states and 73972 transitions. Word has length 57 [2019-12-27 16:34:23,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:23,376 INFO L462 AbstractCegarLoop]: Abstraction has 23483 states and 73972 transitions. [2019-12-27 16:34:23,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:34:23,377 INFO L276 IsEmpty]: Start isEmpty. Operand 23483 states and 73972 transitions. [2019-12-27 16:34:23,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:23,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:23,407 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] [2019-12-27 16:34:23,407 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:23,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:23,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1430783653, now seen corresponding path program 1 times [2019-12-27 16:34:23,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:23,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728241429] [2019-12-27 16:34:23,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:23,462 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-27 16:34:23,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728241429] [2019-12-27 16:34:23,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:23,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:34:23,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [402422054] [2019-12-27 16:34:23,463 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:23,484 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:23,758 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 292 states and 547 transitions. [2019-12-27 16:34:23,758 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:23,771 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:34:23,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:34:23,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:23,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:34:23,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:34:23,772 INFO L87 Difference]: Start difference. First operand 23483 states and 73972 transitions. Second operand 3 states. [2019-12-27 16:34:23,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:23,884 INFO L93 Difference]: Finished difference Result 25041 states and 76723 transitions. [2019-12-27 16:34:23,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:34:23,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 16:34:23,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:23,922 INFO L225 Difference]: With dead ends: 25041 [2019-12-27 16:34:23,922 INFO L226 Difference]: Without dead ends: 25041 [2019-12-27 16:34:23,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:34:24,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25041 states. [2019-12-27 16:34:24,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25041 to 19175. [2019-12-27 16:34:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19175 states. [2019-12-27 16:34:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19175 states to 19175 states and 59124 transitions. [2019-12-27 16:34:24,276 INFO L78 Accepts]: Start accepts. Automaton has 19175 states and 59124 transitions. Word has length 57 [2019-12-27 16:34:24,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:24,277 INFO L462 AbstractCegarLoop]: Abstraction has 19175 states and 59124 transitions. [2019-12-27 16:34:24,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:34:24,277 INFO L276 IsEmpty]: Start isEmpty. Operand 19175 states and 59124 transitions. [2019-12-27 16:34:24,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:24,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:24,299 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] [2019-12-27 16:34:24,299 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:24,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:24,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1904135869, now seen corresponding path program 4 times [2019-12-27 16:34:24,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:24,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18474491] [2019-12-27 16:34:24,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:24,381 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-27 16:34:24,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18474491] [2019-12-27 16:34:24,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:24,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:34:24,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1248063084] [2019-12-27 16:34:24,383 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:24,399 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:24,979 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 325 states and 627 transitions. [2019-12-27 16:34:24,979 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:25,038 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 16:34:25,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:34:25,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:25,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:34:25,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:34:25,039 INFO L87 Difference]: Start difference. First operand 19175 states and 59124 transitions. Second operand 7 states. [2019-12-27 16:34:25,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:25,418 INFO L93 Difference]: Finished difference Result 37600 states and 112477 transitions. [2019-12-27 16:34:25,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 16:34:25,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 16:34:25,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:25,467 INFO L225 Difference]: With dead ends: 37600 [2019-12-27 16:34:25,467 INFO L226 Difference]: Without dead ends: 31952 [2019-12-27 16:34:25,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:34:25,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31952 states. [2019-12-27 16:34:25,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31952 to 19385. [2019-12-27 16:34:25,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19385 states. [2019-12-27 16:34:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19385 states to 19385 states and 59711 transitions. [2019-12-27 16:34:25,880 INFO L78 Accepts]: Start accepts. Automaton has 19385 states and 59711 transitions. Word has length 57 [2019-12-27 16:34:25,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:25,880 INFO L462 AbstractCegarLoop]: Abstraction has 19385 states and 59711 transitions. [2019-12-27 16:34:25,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:34:25,880 INFO L276 IsEmpty]: Start isEmpty. Operand 19385 states and 59711 transitions. [2019-12-27 16:34:25,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:25,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:25,903 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] [2019-12-27 16:34:25,903 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:25,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:25,903 INFO L82 PathProgramCache]: Analyzing trace with hash -576788017, now seen corresponding path program 5 times [2019-12-27 16:34:25,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:25,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574571754] [2019-12-27 16:34:25,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:25,990 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-27 16:34:25,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574571754] [2019-12-27 16:34:25,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:25,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:34:25,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [127893812] [2019-12-27 16:34:25,991 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:26,005 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:26,497 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 380 states and 679 transitions. [2019-12-27 16:34:26,497 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:26,534 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:34:26,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:34:26,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:26,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:34:26,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:34:26,535 INFO L87 Difference]: Start difference. First operand 19385 states and 59711 transitions. Second operand 8 states. [2019-12-27 16:34:27,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:27,437 INFO L93 Difference]: Finished difference Result 33973 states and 100988 transitions. [2019-12-27 16:34:27,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:34:27,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-27 16:34:27,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:27,488 INFO L225 Difference]: With dead ends: 33973 [2019-12-27 16:34:27,488 INFO L226 Difference]: Without dead ends: 33847 [2019-12-27 16:34:27,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:34:27,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33847 states. [2019-12-27 16:34:27,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33847 to 22571. [2019-12-27 16:34:27,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22571 states. [2019-12-27 16:34:27,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22571 states to 22571 states and 69083 transitions. [2019-12-27 16:34:27,933 INFO L78 Accepts]: Start accepts. Automaton has 22571 states and 69083 transitions. Word has length 57 [2019-12-27 16:34:27,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:27,934 INFO L462 AbstractCegarLoop]: Abstraction has 22571 states and 69083 transitions. [2019-12-27 16:34:27,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:34:27,934 INFO L276 IsEmpty]: Start isEmpty. Operand 22571 states and 69083 transitions. [2019-12-27 16:34:27,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:27,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:27,958 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] [2019-12-27 16:34:27,958 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:27,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:27,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1952605815, now seen corresponding path program 6 times [2019-12-27 16:34:27,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:27,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243894204] [2019-12-27 16:34:27,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:28,080 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-27 16:34:28,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243894204] [2019-12-27 16:34:28,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:28,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:34:28,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [150154259] [2019-12-27 16:34:28,082 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:28,098 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:28,319 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 242 states and 395 transitions. [2019-12-27 16:34:28,319 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:28,520 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 16:34:28,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:34:28,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:28,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:34:28,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:34:28,522 INFO L87 Difference]: Start difference. First operand 22571 states and 69083 transitions. Second operand 13 states. [2019-12-27 16:34:33,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:33,364 INFO L93 Difference]: Finished difference Result 63409 states and 190430 transitions. [2019-12-27 16:34:33,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 16:34:33,364 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 16:34:33,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:33,463 INFO L225 Difference]: With dead ends: 63409 [2019-12-27 16:34:33,464 INFO L226 Difference]: Without dead ends: 63409 [2019-12-27 16:34:33,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=394, Invalid=2156, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 16:34:33,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63409 states. [2019-12-27 16:34:34,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63409 to 30718. [2019-12-27 16:34:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30718 states. [2019-12-27 16:34:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30718 states to 30718 states and 94108 transitions. [2019-12-27 16:34:34,254 INFO L78 Accepts]: Start accepts. Automaton has 30718 states and 94108 transitions. Word has length 57 [2019-12-27 16:34:34,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:34,254 INFO L462 AbstractCegarLoop]: Abstraction has 30718 states and 94108 transitions. [2019-12-27 16:34:34,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:34:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 30718 states and 94108 transitions. [2019-12-27 16:34:34,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:34,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:34,291 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] [2019-12-27 16:34:34,291 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:34,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:34,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2126429955, now seen corresponding path program 7 times [2019-12-27 16:34:34,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:34,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319361199] [2019-12-27 16:34:34,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:34:34,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319361199] [2019-12-27 16:34:34,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:34,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:34:34,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [402245662] [2019-12-27 16:34:34,440 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:34,456 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:35,036 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 433 states and 781 transitions. [2019-12-27 16:34:35,036 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:35,238 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:34:35,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:34:35,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:35,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:34:35,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:34:35,240 INFO L87 Difference]: Start difference. First operand 30718 states and 94108 transitions. Second operand 14 states. [2019-12-27 16:34:40,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:40,153 INFO L93 Difference]: Finished difference Result 80769 states and 238600 transitions. [2019-12-27 16:34:40,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 16:34:40,154 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-27 16:34:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:40,295 INFO L225 Difference]: With dead ends: 80769 [2019-12-27 16:34:40,295 INFO L226 Difference]: Without dead ends: 80769 [2019-12-27 16:34:40,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=573, Invalid=3209, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 16:34:40,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80769 states. [2019-12-27 16:34:41,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80769 to 35374. [2019-12-27 16:34:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35374 states. [2019-12-27 16:34:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35374 states to 35374 states and 107576 transitions. [2019-12-27 16:34:41,548 INFO L78 Accepts]: Start accepts. Automaton has 35374 states and 107576 transitions. Word has length 57 [2019-12-27 16:34:41,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:41,549 INFO L462 AbstractCegarLoop]: Abstraction has 35374 states and 107576 transitions. [2019-12-27 16:34:41,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:34:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 35374 states and 107576 transitions. [2019-12-27 16:34:41,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:41,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:41,589 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] [2019-12-27 16:34:41,589 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:41,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:41,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1809878711, now seen corresponding path program 8 times [2019-12-27 16:34:41,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:41,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26533747] [2019-12-27 16:34:41,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:41,768 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-27 16:34:41,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26533747] [2019-12-27 16:34:41,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:41,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:34:41,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [184048541] [2019-12-27 16:34:41,770 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:41,783 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:42,232 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 343 states and 570 transitions. [2019-12-27 16:34:42,232 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:42,965 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-27 16:34:42,965 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 16:34:42,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 16:34:42,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:42,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 16:34:42,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2019-12-27 16:34:42,970 INFO L87 Difference]: Start difference. First operand 35374 states and 107576 transitions. Second operand 22 states. [2019-12-27 16:34:43,387 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-12-27 16:34:44,642 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-12-27 16:34:45,143 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-27 16:34:46,743 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 16:34:49,504 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-27 16:34:50,333 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-27 16:34:51,089 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-27 16:34:52,399 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-12-27 16:34:52,632 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-27 16:34:54,636 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-12-27 16:34:55,062 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 16:34:55,880 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-27 16:34:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:56,978 INFO L93 Difference]: Finished difference Result 88628 states and 259246 transitions. [2019-12-27 16:34:56,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-12-27 16:34:56,979 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2019-12-27 16:34:56,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:57,114 INFO L225 Difference]: With dead ends: 88628 [2019-12-27 16:34:57,114 INFO L226 Difference]: Without dead ends: 88237 [2019-12-27 16:34:57,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4247 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2218, Invalid=10438, Unknown=0, NotChecked=0, Total=12656 [2019-12-27 16:34:57,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88237 states. [2019-12-27 16:34:58,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88237 to 39084. [2019-12-27 16:34:58,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39084 states. [2019-12-27 16:34:58,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39084 states to 39084 states and 117105 transitions. [2019-12-27 16:34:58,271 INFO L78 Accepts]: Start accepts. Automaton has 39084 states and 117105 transitions. Word has length 57 [2019-12-27 16:34:58,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:58,271 INFO L462 AbstractCegarLoop]: Abstraction has 39084 states and 117105 transitions. [2019-12-27 16:34:58,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 16:34:58,271 INFO L276 IsEmpty]: Start isEmpty. Operand 39084 states and 117105 transitions. [2019-12-27 16:34:58,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:34:58,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:58,315 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] [2019-12-27 16:34:58,315 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:58,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:58,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1326524261, now seen corresponding path program 9 times [2019-12-27 16:34:58,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:58,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677686316] [2019-12-27 16:34:58,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:58,377 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-27 16:34:58,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677686316] [2019-12-27 16:34:58,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:58,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:34:58,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1689933973] [2019-12-27 16:34:58,378 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:58,389 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:58,969 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 386 states and 665 transitions. [2019-12-27 16:34:58,970 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:58,970 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:34:58,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:34:58,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:58,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:34:58,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:34:58,971 INFO L87 Difference]: Start difference. First operand 39084 states and 117105 transitions. Second operand 3 states. [2019-12-27 16:34:59,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:59,100 INFO L93 Difference]: Finished difference Result 39084 states and 117103 transitions. [2019-12-27 16:34:59,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:34:59,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 16:34:59,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:59,164 INFO L225 Difference]: With dead ends: 39084 [2019-12-27 16:34:59,164 INFO L226 Difference]: Without dead ends: 39084 [2019-12-27 16:34:59,164 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-27 16:34:59,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39084 states. [2019-12-27 16:34:59,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39084 to 32036. [2019-12-27 16:34:59,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32036 states. [2019-12-27 16:34:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32036 states to 32036 states and 97628 transitions. [2019-12-27 16:34:59,737 INFO L78 Accepts]: Start accepts. Automaton has 32036 states and 97628 transitions. Word has length 57 [2019-12-27 16:34:59,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:59,738 INFO L462 AbstractCegarLoop]: Abstraction has 32036 states and 97628 transitions. [2019-12-27 16:34:59,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:34:59,738 INFO L276 IsEmpty]: Start isEmpty. Operand 32036 states and 97628 transitions. [2019-12-27 16:34:59,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 16:34:59,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:59,772 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] [2019-12-27 16:34:59,772 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:59,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:59,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1231350538, now seen corresponding path program 1 times [2019-12-27 16:34:59,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:59,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457162357] [2019-12-27 16:34:59,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:34:59,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457162357] [2019-12-27 16:34:59,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:59,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:34:59,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [163818684] [2019-12-27 16:34:59,839 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:59,850 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:35:00,095 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 295 states and 510 transitions. [2019-12-27 16:35:00,095 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:35:00,096 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:35:00,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:35:00,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:35:00,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:35:00,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:35:00,097 INFO L87 Difference]: Start difference. First operand 32036 states and 97628 transitions. Second operand 3 states. [2019-12-27 16:35:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:35:00,336 INFO L93 Difference]: Finished difference Result 25043 states and 75476 transitions. [2019-12-27 16:35:00,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:35:00,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 16:35:00,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:35:00,371 INFO L225 Difference]: With dead ends: 25043 [2019-12-27 16:35:00,371 INFO L226 Difference]: Without dead ends: 25043 [2019-12-27 16:35:00,371 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-27 16:35:00,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25043 states. [2019-12-27 16:35:00,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25043 to 24203. [2019-12-27 16:35:00,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24203 states. [2019-12-27 16:35:00,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24203 states to 24203 states and 72933 transitions. [2019-12-27 16:35:00,742 INFO L78 Accepts]: Start accepts. Automaton has 24203 states and 72933 transitions. Word has length 58 [2019-12-27 16:35:00,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:35:00,742 INFO L462 AbstractCegarLoop]: Abstraction has 24203 states and 72933 transitions. [2019-12-27 16:35:00,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:35:00,742 INFO L276 IsEmpty]: Start isEmpty. Operand 24203 states and 72933 transitions. [2019-12-27 16:35:00,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 16:35:00,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:35:00,769 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] [2019-12-27 16:35:00,769 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:35:00,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:35:00,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1265178387, now seen corresponding path program 1 times [2019-12-27 16:35:00,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:35:00,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255356499] [2019-12-27 16:35:00,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:35:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:35:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:35:00,910 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:35:00,910 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:35:00,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$mem_tmp~0_52 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t717~0.base_21|) 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t717~0.base_21| 4) |v_#length_29|) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff1_thd0~0_155 0) (= v_~y$r_buff0_thd0~0_159 0) (= v_~y$w_buff1_used~0_637 0) (= v_~y$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p3_EBX~0_27) (= 0 v_~y$r_buff1_thd3~0_151) (= 0 v_~y$r_buff0_thd4~0_154) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_p3_EAX~0_27) (= 0 v_~y$r_buff0_thd2~0_336) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t717~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t717~0.base_21|) |v_ULTIMATE.start_main_~#t717~0.offset_16| 0)) |v_#memory_int_27|) (= 0 v_~y$r_buff1_thd4~0_190) (= (store .cse0 |v_ULTIMATE.start_main_~#t717~0.base_21| 1) |v_#valid_66|) (= v_~y~0_177 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$flush_delayed~0_106 0) (= v_~weak$$choice2~0_150 0) (= v_~y$w_buff1~0_392 0) (= 0 v_~y$r_buff1_thd2~0_255) (= 0 v_~y$r_buff0_thd3~0_211) (= v_~a~0_32 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t717~0.base_21|) (= v_~__unbuffered_cnt~0_242 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_105 0) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p1_EAX~0_27) (= 0 |v_ULTIMATE.start_main_~#t717~0.offset_16|) (= v_~y$w_buff0_used~0_880 0) (= 0 v_~y$w_buff0~0_485) (= 0 v_~weak$$choice0~0_13) (= 0 v_~y$r_buff1_thd1~0_85) (= v_~y$r_buff0_thd1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t719~0.offset=|v_ULTIMATE.start_main_~#t719~0.offset_17|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_48|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_70|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_92|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ULTIMATE.start_main_~#t720~0.base=|v_ULTIMATE.start_main_~#t720~0.base_22|, ~a~0=v_~a~0_32, ~y$mem_tmp~0=v_~y$mem_tmp~0_52, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_151, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_27, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_24|, ULTIMATE.start_main_~#t717~0.offset=|v_ULTIMATE.start_main_~#t717~0.offset_16|, ULTIMATE.start_main_~#t720~0.offset=|v_ULTIMATE.start_main_~#t720~0.offset_17|, ULTIMATE.start_main_~#t718~0.base=|v_ULTIMATE.start_main_~#t718~0.base_21|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_190, ~y$w_buff1~0=v_~y$w_buff1~0_392, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t717~0.base=|v_ULTIMATE.start_main_~#t717~0.base_21|, ULTIMATE.start_main_~#t718~0.offset=|v_ULTIMATE.start_main_~#t718~0.offset_17|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_336, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_242, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_155, ~x~0=v_~x~0_47, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_880, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_46|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_52|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_52|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_211, ULTIMATE.start_main_~#t719~0.base=|v_ULTIMATE.start_main_~#t719~0.base_22|, ~y~0=v_~y~0_177, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_27, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_255, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_154, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_637} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t719~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t720~0.base, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t717~0.offset, ULTIMATE.start_main_~#t720~0.offset, ULTIMATE.start_main_~#t718~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t717~0.base, ULTIMATE.start_main_~#t718~0.offset, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t719~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 16:35:00,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L841-1-->L843: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t718~0.base_10|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t718~0.base_10| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t718~0.base_10|) |v_ULTIMATE.start_main_~#t718~0.offset_10| 1)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t718~0.base_10|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t718~0.base_10| 4) |v_#length_23|) (= 0 |v_ULTIMATE.start_main_~#t718~0.offset_10|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t718~0.base_10| 1) |v_#valid_41|) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t718~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t718~0.offset=|v_ULTIMATE.start_main_~#t718~0.offset_10|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t718~0.base=|v_ULTIMATE.start_main_~#t718~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t718~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t718~0.base] because there is no mapped edge [2019-12-27 16:35:00,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t719~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t719~0.offset_10|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t719~0.base_11| 4)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t719~0.base_11| 1)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t719~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t719~0.base_11| 0)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t719~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t719~0.base_11|) |v_ULTIMATE.start_main_~#t719~0.offset_10| 2)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t719~0.base=|v_ULTIMATE.start_main_~#t719~0.base_11|, ULTIMATE.start_main_~#t719~0.offset=|v_ULTIMATE.start_main_~#t719~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t719~0.base, ULTIMATE.start_main_~#t719~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 16:35:00,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L4-->L795: Formula: (and (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42 0)) (= v_~y$r_buff0_thd3~0_44 1) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd4~0_33 v_~y$r_buff1_thd4~0_33) (= v_~y$r_buff0_thd3~0_45 v_~y$r_buff1_thd3~0_21) (= v_~z~0_14 1) (= v_~y$r_buff0_thd0~0_33 v_~y$r_buff1_thd0~0_32)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_33, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_44, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 16:35:00,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L845-1-->L847: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t720~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t720~0.base_11|) |v_ULTIMATE.start_main_~#t720~0.offset_10| 3)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t720~0.offset_10| 0) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t720~0.base_11| 1)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t720~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t720~0.base_11|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t720~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t720~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t720~0.base=|v_ULTIMATE.start_main_~#t720~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t720~0.offset=|v_ULTIMATE.start_main_~#t720~0.offset_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t720~0.base, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t720~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 16:35:00,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-2-->L818-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork0_#t~ite33_Out-517342361| |P3Thread1of1ForFork0_#t~ite32_Out-517342361|)) (.cse2 (= (mod ~y$w_buff1_used~0_In-517342361 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd4~0_In-517342361 256) 0))) (or (and (= ~y$w_buff1~0_In-517342361 |P3Thread1of1ForFork0_#t~ite32_Out-517342361|) .cse0 (not .cse1) (not .cse2)) (and (= ~y~0_In-517342361 |P3Thread1of1ForFork0_#t~ite32_Out-517342361|) .cse0 (or .cse2 .cse1)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-517342361, ~y$w_buff1~0=~y$w_buff1~0_In-517342361, ~y~0=~y~0_In-517342361, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-517342361} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-517342361, ~y$w_buff1~0=~y$w_buff1~0_In-517342361, ~y~0=~y~0_In-517342361, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-517342361|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-517342361|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-517342361} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 16:35:00,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~a~0_20 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{~a~0=v_~a~0_20, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_28, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 16:35:00,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-732280209 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-732280209 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out-732280209| ~y$w_buff0_used~0_In-732280209) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out-732280209| 0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-732280209, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-732280209} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-732280209, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-732280209, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-732280209|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-27 16:35:00,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L820-->L820-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd4~0_In409026902 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In409026902 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In409026902 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In409026902 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In409026902 |P3Thread1of1ForFork0_#t~ite35_Out409026902|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P3Thread1of1ForFork0_#t~ite35_Out409026902|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In409026902, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In409026902, ~y$w_buff0_used~0=~y$w_buff0_used~0_In409026902, ~y$w_buff1_used~0=~y$w_buff1_used~0_In409026902} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In409026902, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In409026902, ~y$w_buff0_used~0=~y$w_buff0_used~0_In409026902, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out409026902|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In409026902} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-27 16:35:00,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In890243874 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In890243874 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite36_Out890243874|)) (and (= ~y$r_buff0_thd4~0_In890243874 |P3Thread1of1ForFork0_#t~ite36_Out890243874|) (or .cse0 .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In890243874, ~y$w_buff0_used~0=~y$w_buff0_used~0_In890243874} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In890243874, ~y$w_buff0_used~0=~y$w_buff0_used~0_In890243874, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out890243874|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-27 16:35:00,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In760834627 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In760834627 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In760834627 256))) (.cse3 (= (mod ~y$r_buff0_thd4~0_In760834627 256) 0))) (or (and (= 0 |P3Thread1of1ForFork0_#t~ite37_Out760834627|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd4~0_In760834627 |P3Thread1of1ForFork0_#t~ite37_Out760834627|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In760834627, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In760834627, ~y$w_buff0_used~0=~y$w_buff0_used~0_In760834627, ~y$w_buff1_used~0=~y$w_buff1_used~0_In760834627} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In760834627, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In760834627, ~y$w_buff0_used~0=~y$w_buff0_used~0_In760834627, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out760834627|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In760834627} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-27 16:35:00,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L822-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_42| v_~y$r_buff1_thd4~0_62) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_62, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_41|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:35:00,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L760-->L760-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-638289171 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-638289171| |P1Thread1of1ForFork2_#t~ite12_Out-638289171|) .cse0 (= |P1Thread1of1ForFork2_#t~ite11_Out-638289171| ~y$w_buff1~0_In-638289171) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-638289171 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-638289171 256))) (= (mod ~y$w_buff0_used~0_In-638289171 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-638289171 256) 0))))) (and (= |P1Thread1of1ForFork2_#t~ite11_In-638289171| |P1Thread1of1ForFork2_#t~ite11_Out-638289171|) (= |P1Thread1of1ForFork2_#t~ite12_Out-638289171| ~y$w_buff1~0_In-638289171) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-638289171, ~y$w_buff1~0=~y$w_buff1~0_In-638289171, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-638289171, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-638289171, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-638289171|, ~weak$$choice2~0=~weak$$choice2~0_In-638289171, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-638289171} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-638289171, ~y$w_buff1~0=~y$w_buff1~0_In-638289171, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-638289171, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-638289171, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-638289171|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-638289171|, ~weak$$choice2~0=~weak$$choice2~0_In-638289171, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-638289171} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 16:35:00,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L761-->L761-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2115752483 256)))) (or (and (= ~y$w_buff0_used~0_In2115752483 |P1Thread1of1ForFork2_#t~ite14_Out2115752483|) (= |P1Thread1of1ForFork2_#t~ite15_Out2115752483| |P1Thread1of1ForFork2_#t~ite14_Out2115752483|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In2115752483 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In2115752483 256)) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In2115752483 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In2115752483 256)))) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite14_In2115752483| |P1Thread1of1ForFork2_#t~ite14_Out2115752483|) (= |P1Thread1of1ForFork2_#t~ite15_Out2115752483| ~y$w_buff0_used~0_In2115752483)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2115752483, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2115752483, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2115752483, ~weak$$choice2~0=~weak$$choice2~0_In2115752483, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In2115752483|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2115752483} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2115752483, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2115752483, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2115752483, ~weak$$choice2~0=~weak$$choice2~0_In2115752483, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out2115752483|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out2115752483|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2115752483} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 16:35:00,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L764: Formula: (and (= v_~y$r_buff0_thd2~0_95 v_~y$r_buff0_thd2~0_94) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_94, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_9|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 16:35:00,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-588693704 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite23_Out-588693704| ~y$r_buff1_thd2~0_In-588693704) .cse0 (= |P1Thread1of1ForFork2_#t~ite23_Out-588693704| |P1Thread1of1ForFork2_#t~ite24_Out-588693704|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-588693704 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-588693704 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-588693704 256) 0)) (and (= 0 (mod ~y$r_buff1_thd2~0_In-588693704 256)) .cse1)))) (and (= |P1Thread1of1ForFork2_#t~ite23_In-588693704| |P1Thread1of1ForFork2_#t~ite23_Out-588693704|) (= |P1Thread1of1ForFork2_#t~ite24_Out-588693704| ~y$r_buff1_thd2~0_In-588693704) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-588693704, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-588693704, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-588693704, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-588693704|, ~weak$$choice2~0=~weak$$choice2~0_In-588693704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-588693704} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-588693704, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-588693704, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-588693704, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-588693704|, ~weak$$choice2~0=~weak$$choice2~0_In-588693704, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-588693704|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-588693704} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 16:35:00,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L766-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_51 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~y~0=v_~y~0_51, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 16:35:00,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In666020483 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In666020483 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In666020483 |P2Thread1of1ForFork3_#t~ite28_Out666020483|)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out666020483| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In666020483, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In666020483} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In666020483, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In666020483, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out666020483|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-27 16:35:00,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L797-->L797-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1531736552 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In1531736552 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1531736552 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1531736552 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1531736552 |P2Thread1of1ForFork3_#t~ite29_Out1531736552|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork3_#t~ite29_Out1531736552|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1531736552, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1531736552, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1531736552, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1531736552} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1531736552, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1531736552, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1531736552, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out1531736552|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1531736552} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-27 16:35:00,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L798-->L799: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2133861002 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-2133861002 256)))) (or (and (= ~y$r_buff0_thd3~0_In-2133861002 ~y$r_buff0_thd3~0_Out-2133861002) (or .cse0 .cse1)) (and (= 0 ~y$r_buff0_thd3~0_Out-2133861002) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2133861002, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2133861002} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-2133861002|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2133861002, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-2133861002} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 16:35:00,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-2040053776 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-2040053776 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-2040053776 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-2040053776 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite31_Out-2040053776| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork3_#t~ite31_Out-2040053776| ~y$r_buff1_thd3~0_In-2040053776) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2040053776, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2040053776, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2040053776, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2040053776} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2040053776, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2040053776, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2040053776, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-2040053776|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2040053776} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-27 16:35:00,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L799-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_128 (+ v_~__unbuffered_cnt~0_129 1)) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= |v_P2Thread1of1ForFork3_#t~ite31_38| v_~y$r_buff1_thd3~0_60)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_60, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 16:35:00,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L853: Formula: (and (= 4 v_~__unbuffered_cnt~0_30) (= v_~main$tmp_guard0~0_10 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:35:00,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L853-2-->L853-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite43_Out-1503604798| |ULTIMATE.start_main_#t~ite42_Out-1503604798|)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1503604798 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1503604798 256) 0))) (or (and .cse0 (not .cse1) (= ~y$w_buff1~0_In-1503604798 |ULTIMATE.start_main_#t~ite42_Out-1503604798|) (not .cse2)) (and .cse0 (= ~y~0_In-1503604798 |ULTIMATE.start_main_#t~ite42_Out-1503604798|) (or .cse1 .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1503604798, ~y~0=~y~0_In-1503604798, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1503604798, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1503604798} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1503604798, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1503604798|, ~y~0=~y~0_In-1503604798, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1503604798|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1503604798, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1503604798} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:35:00,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1058354296 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1058354296 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1058354296|)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1058354296| ~y$w_buff0_used~0_In-1058354296) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1058354296, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1058354296} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1058354296, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1058354296, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1058354296|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 16:35:00,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1446542332 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1446542332 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1446542332 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1446542332 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1446542332|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1446542332 |ULTIMATE.start_main_#t~ite45_Out-1446542332|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1446542332, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1446542332, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1446542332, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1446542332} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1446542332, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1446542332, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1446542332, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1446542332|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1446542332} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 16:35:00,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-266449445 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-266449445 256)))) (or (and (= ~y$r_buff0_thd0~0_In-266449445 |ULTIMATE.start_main_#t~ite46_Out-266449445|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite46_Out-266449445| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-266449445, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-266449445} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-266449445, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-266449445, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-266449445|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 16:35:00,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L857-->L857-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1280386749 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1280386749 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1280386749 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1280386749 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite47_Out1280386749| 0)) (and (= |ULTIMATE.start_main_#t~ite47_Out1280386749| ~y$r_buff1_thd0~0_In1280386749) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1280386749, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1280386749, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1280386749, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1280386749} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1280386749, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1280386749, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1280386749|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1280386749, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1280386749} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 16:35:00,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p3_EAX~0_22) (= 0 v_~__unbuffered_p1_EAX~0_23) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_23 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_40|) (= v_~x~0_41 2) (= v_~main$tmp_guard1~0_23 0) (= v_~z~0_83 2) (= 0 v_~__unbuffered_p3_EBX~0_22)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:35:01,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:35:01 BasicIcfg [2019-12-27 16:35:01,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:35:01,070 INFO L168 Benchmark]: Toolchain (without parser) took 199764.55 ms. Allocated memory was 144.7 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 100.9 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 16:35:01,070 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 16:35:01,071 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.56 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.7 MB in the beginning and 154.7 MB in the end (delta: -54.1 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2019-12-27 16:35:01,071 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.95 ms. Allocated memory is still 201.9 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:35:01,072 INFO L168 Benchmark]: Boogie Preprocessor took 62.58 ms. Allocated memory is still 201.9 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:35:01,072 INFO L168 Benchmark]: RCFGBuilder took 861.59 ms. Allocated memory is still 201.9 MB. Free memory was 150.1 MB in the beginning and 100.9 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-27 16:35:01,073 INFO L168 Benchmark]: TraceAbstraction took 198044.51 ms. Allocated memory was 201.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.2 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 16:35:01,076 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 724.56 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.7 MB in the beginning and 154.7 MB in the end (delta: -54.1 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.95 ms. Allocated memory is still 201.9 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.58 ms. Allocated memory is still 201.9 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 861.59 ms. Allocated memory is still 201.9 MB. Free memory was 150.1 MB in the beginning and 100.9 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 198044.51 ms. Allocated memory was 201.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.2 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 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, 90 ProgramPointsAfterwards, 208 TransitionsBefore, 97 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 7595 VarBasedMoverChecksPositive, 274 VarBasedMoverChecksNegative, 123 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 74757 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t717, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] FCALL, FORK 0 pthread_create(&t718, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t719, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L847] FCALL, FORK 0 pthread_create(&t720, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 4 z = 2 [L812] 4 __unbuffered_p3_EAX = z [L815] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L751] 2 x = 2 [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L821] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L759] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L760] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L761] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L762] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L795] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L853] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 197.6s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 58.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5336 SDtfs, 10755 SDslu, 17633 SDs, 0 SdLazy, 17442 SolverSat, 1167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 636 GetRequests, 209 SyntacticMatches, 43 SemanticMatches, 384 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6742 ImplicationChecksByTransitivity, 13.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235278occurred 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: 81.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 414272 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1016 NumberOfCodeBlocks, 1016 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 934 ConstructedInterpolants, 0 QuantifiedInterpolants, 162072 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...