/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:01:15,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:01:15,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:01:15,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:01:15,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:01:15,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:01:15,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:01:15,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:01:15,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:01:15,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:01:15,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:01:15,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:01:15,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:01:15,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:01:15,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:01:15,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:01:15,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:01:15,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:01:15,170 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:01:15,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:01:15,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:01:15,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:01:15,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:01:15,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:01:15,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:01:15,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:01:15,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:01:15,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:01:15,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:01:15,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:01:15,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:01:15,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:01:15,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:01:15,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:01:15,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:01:15,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:01:15,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:01:15,187 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:01:15,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:01:15,188 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:01:15,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:01:15,189 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:01:15,203 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:01:15,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:01:15,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:01:15,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:01:15,205 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:01:15,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:01:15,206 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:01:15,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:01:15,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:01:15,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:01:15,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:01:15,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:01:15,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:01:15,207 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:01:15,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:01:15,207 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:01:15,207 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:01:15,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:01:15,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:01:15,208 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:01:15,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:01:15,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:01:15,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:01:15,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:01:15,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:01:15,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:01:15,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:01:15,210 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:01:15,210 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:01:15,210 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:01:15,210 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:01:15,210 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:01:15,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:01:15,525 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:01:15,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:01:15,529 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:01:15,530 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:01:15,531 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_rmo.opt.i [2019-12-27 21:01:15,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6819d4c0d/3dffe23a18c84df0a30d8a380d1033a7/FLAG636f29912 [2019-12-27 21:01:16,164 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:01:16,165 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_rmo.opt.i [2019-12-27 21:01:16,180 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6819d4c0d/3dffe23a18c84df0a30d8a380d1033a7/FLAG636f29912 [2019-12-27 21:01:16,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6819d4c0d/3dffe23a18c84df0a30d8a380d1033a7 [2019-12-27 21:01:16,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:01:16,436 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:01:16,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:01:16,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:01:16,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:01:16,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:01:16" (1/1) ... [2019-12-27 21:01:16,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aad24cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:16, skipping insertion in model container [2019-12-27 21:01:16,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:01:16" (1/1) ... [2019-12-27 21:01:16,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:01:16,512 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:01:17,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:01:17,055 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:01:17,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:01:17,215 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:01:17,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:17 WrapperNode [2019-12-27 21:01:17,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:01:17,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:01:17,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:01:17,217 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:01:17,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:17" (1/1) ... [2019-12-27 21:01:17,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:17" (1/1) ... [2019-12-27 21:01:17,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:01:17,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:01:17,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:01:17,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:01:17,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:17" (1/1) ... [2019-12-27 21:01:17,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:17" (1/1) ... [2019-12-27 21:01:17,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:17" (1/1) ... [2019-12-27 21:01:17,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:17" (1/1) ... [2019-12-27 21:01:17,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:17" (1/1) ... [2019-12-27 21:01:17,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:17" (1/1) ... [2019-12-27 21:01:17,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:17" (1/1) ... [2019-12-27 21:01:17,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:01:17,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:01:17,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:01:17,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:01:17,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:17" (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 21:01:17,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:01:17,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:01:17,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:01:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:01:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:01:17,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:01:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:01:17,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:01:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:01:17,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:01:17,384 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 21:01:17,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 21:01:17,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:01:17,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:01:17,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:01:17,386 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 21:01:18,183 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:01:18,183 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:01:18,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:01:18 BoogieIcfgContainer [2019-12-27 21:01:18,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:01:18,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:01:18,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:01:18,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:01:18,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:01:16" (1/3) ... [2019-12-27 21:01:18,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed3b534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:01:18, skipping insertion in model container [2019-12-27 21:01:18,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:01:17" (2/3) ... [2019-12-27 21:01:18,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed3b534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:01:18, skipping insertion in model container [2019-12-27 21:01:18,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:01:18" (3/3) ... [2019-12-27 21:01:18,193 INFO L109 eAbstractionObserver]: Analyzing ICFG mix036_rmo.opt.i [2019-12-27 21:01:18,203 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:01:18,203 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:01:18,211 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:01:18,211 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:01:18,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,254 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,254 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,258 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,282 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,282 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,283 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,283 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,301 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,315 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,315 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,320 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,321 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,321 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,321 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,321 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,322 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,322 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,322 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,322 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,322 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,323 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,323 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,323 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,323 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,323 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,324 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,324 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,324 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,324 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,328 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,328 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,329 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,329 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,331 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,331 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,331 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,331 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,332 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,332 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,336 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,336 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,339 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,342 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,346 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,346 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,346 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:01:18,363 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 21:01:18,385 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:01:18,385 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:01:18,385 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:01:18,386 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:01:18,386 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:01:18,386 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:01:18,386 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:01:18,386 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:01:18,410 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 211 transitions [2019-12-27 21:01:18,413 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 183 places, 211 transitions [2019-12-27 21:01:18,530 INFO L132 PetriNetUnfolder]: 41/207 cut-off events. [2019-12-27 21:01:18,530 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:01:18,552 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 207 events. 41/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:01:18,579 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 183 places, 211 transitions [2019-12-27 21:01:18,636 INFO L132 PetriNetUnfolder]: 41/207 cut-off events. [2019-12-27 21:01:18,636 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:01:18,644 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 207 events. 41/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:01:18,665 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-27 21:01:18,667 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:01:22,352 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 21:01:22,458 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 21:01:22,911 WARN L192 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-27 21:01:23,062 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-12-27 21:01:23,082 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77566 [2019-12-27 21:01:23,082 INFO L214 etLargeBlockEncoding]: Total number of compositions: 124 [2019-12-27 21:01:23,086 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-27 21:02:01,746 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 177426 states. [2019-12-27 21:02:01,748 INFO L276 IsEmpty]: Start isEmpty. Operand 177426 states. [2019-12-27 21:02:01,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 21:02:01,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:01,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:02:01,756 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 21:02:01,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:01,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1556658876, now seen corresponding path program 1 times [2019-12-27 21:02:01,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:01,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174324941] [2019-12-27 21:02:01,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:02,061 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 21:02:02,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174324941] [2019-12-27 21:02:02,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:02,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:02:02,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1428225136] [2019-12-27 21:02:02,068 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:02,074 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:02,091 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 21:02:02,091 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:02,096 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:02:02,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:02:02,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:02,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:02:02,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:02:02,115 INFO L87 Difference]: Start difference. First operand 177426 states. Second operand 3 states. [2019-12-27 21:02:07,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:07,170 INFO L93 Difference]: Finished difference Result 174206 states and 838758 transitions. [2019-12-27 21:02:07,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:02:07,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 21:02:07,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:08,326 INFO L225 Difference]: With dead ends: 174206 [2019-12-27 21:02:08,326 INFO L226 Difference]: Without dead ends: 164066 [2019-12-27 21:02:08,328 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 21:02:18,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164066 states. [2019-12-27 21:02:21,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164066 to 164066. [2019-12-27 21:02:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164066 states. [2019-12-27 21:02:28,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164066 states to 164066 states and 788968 transitions. [2019-12-27 21:02:28,084 INFO L78 Accepts]: Start accepts. Automaton has 164066 states and 788968 transitions. Word has length 7 [2019-12-27 21:02:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:28,085 INFO L462 AbstractCegarLoop]: Abstraction has 164066 states and 788968 transitions. [2019-12-27 21:02:28,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:02:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 164066 states and 788968 transitions. [2019-12-27 21:02:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:02:28,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:28,096 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:02:28,097 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 21:02:28,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:28,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1187468255, now seen corresponding path program 1 times [2019-12-27 21:02:28,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:28,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431253692] [2019-12-27 21:02:28,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:28,193 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 21:02:28,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431253692] [2019-12-27 21:02:28,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:28,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:02:28,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [291523956] [2019-12-27 21:02:28,194 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:28,196 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:28,201 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:02:28,201 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:28,201 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:02:28,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:02:28,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:28,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:02:28,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:02:28,204 INFO L87 Difference]: Start difference. First operand 164066 states and 788968 transitions. Second operand 3 states. [2019-12-27 21:02:29,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:29,195 INFO L93 Difference]: Finished difference Result 103562 states and 449532 transitions. [2019-12-27 21:02:29,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:02:29,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 21:02:29,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:35,688 INFO L225 Difference]: With dead ends: 103562 [2019-12-27 21:02:35,688 INFO L226 Difference]: Without dead ends: 103562 [2019-12-27 21:02:35,689 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 21:02:38,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103562 states. [2019-12-27 21:02:40,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103562 to 103562. [2019-12-27 21:02:40,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103562 states. [2019-12-27 21:02:40,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103562 states to 103562 states and 449532 transitions. [2019-12-27 21:02:40,678 INFO L78 Accepts]: Start accepts. Automaton has 103562 states and 449532 transitions. Word has length 15 [2019-12-27 21:02:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:40,678 INFO L462 AbstractCegarLoop]: Abstraction has 103562 states and 449532 transitions. [2019-12-27 21:02:40,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:02:40,679 INFO L276 IsEmpty]: Start isEmpty. Operand 103562 states and 449532 transitions. [2019-12-27 21:02:40,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:02:40,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:40,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:02:40,682 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 21:02:40,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:40,682 INFO L82 PathProgramCache]: Analyzing trace with hash -444517235, now seen corresponding path program 1 times [2019-12-27 21:02:40,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:40,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044022176] [2019-12-27 21:02:40,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:40,822 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 21:02:40,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044022176] [2019-12-27 21:02:40,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:40,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:02:40,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1272437033] [2019-12-27 21:02:40,823 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:40,829 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:40,831 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:02:40,831 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:40,832 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:02:40,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:02:40,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:40,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:02:40,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:02:40,833 INFO L87 Difference]: Start difference. First operand 103562 states and 449532 transitions. Second operand 4 states. [2019-12-27 21:02:43,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:43,038 INFO L93 Difference]: Finished difference Result 160711 states and 667320 transitions. [2019-12-27 21:02:43,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:02:43,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 21:02:43,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:43,592 INFO L225 Difference]: With dead ends: 160711 [2019-12-27 21:02:43,593 INFO L226 Difference]: Without dead ends: 160592 [2019-12-27 21:02:43,593 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 21:02:47,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160592 states. [2019-12-27 21:02:57,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160592 to 146257. [2019-12-27 21:02:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146257 states. [2019-12-27 21:02:58,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146257 states to 146257 states and 614556 transitions. [2019-12-27 21:02:58,114 INFO L78 Accepts]: Start accepts. Automaton has 146257 states and 614556 transitions. Word has length 15 [2019-12-27 21:02:58,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:58,114 INFO L462 AbstractCegarLoop]: Abstraction has 146257 states and 614556 transitions. [2019-12-27 21:02:58,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:02:58,114 INFO L276 IsEmpty]: Start isEmpty. Operand 146257 states and 614556 transitions. [2019-12-27 21:02:58,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:02:58,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:58,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:02:58,118 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 21:02:58,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:58,119 INFO L82 PathProgramCache]: Analyzing trace with hash -798602882, now seen corresponding path program 1 times [2019-12-27 21:02:58,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:58,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912209816] [2019-12-27 21:02:58,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:02:58,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912209816] [2019-12-27 21:02:58,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:58,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:02:58,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [282663217] [2019-12-27 21:02:58,178 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:58,179 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:58,181 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 21:02:58,182 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:58,183 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:02:58,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:02:58,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:58,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:02:58,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:02:58,184 INFO L87 Difference]: Start difference. First operand 146257 states and 614556 transitions. Second operand 4 states. [2019-12-27 21:02:58,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:58,406 INFO L93 Difference]: Finished difference Result 39473 states and 140838 transitions. [2019-12-27 21:02:58,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:02:58,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 21:02:58,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:58,483 INFO L225 Difference]: With dead ends: 39473 [2019-12-27 21:02:58,483 INFO L226 Difference]: Without dead ends: 39473 [2019-12-27 21:02:58,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:02:59,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39473 states. [2019-12-27 21:02:59,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39473 to 39473. [2019-12-27 21:02:59,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39473 states. [2019-12-27 21:03:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39473 states to 39473 states and 140838 transitions. [2019-12-27 21:03:00,078 INFO L78 Accepts]: Start accepts. Automaton has 39473 states and 140838 transitions. Word has length 16 [2019-12-27 21:03:00,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:03:00,078 INFO L462 AbstractCegarLoop]: Abstraction has 39473 states and 140838 transitions. [2019-12-27 21:03:00,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:03:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand 39473 states and 140838 transitions. [2019-12-27 21:03:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:03:00,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:03:00,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:03:00,082 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 21:03:00,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:03:00,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1050404483, now seen corresponding path program 1 times [2019-12-27 21:03:00,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:03:00,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089495851] [2019-12-27 21:03:00,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:03:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:03:00,145 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 21:03:00,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089495851] [2019-12-27 21:03:00,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:03:00,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:03:00,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [392971317] [2019-12-27 21:03:00,147 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:03:00,149 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:03:00,153 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 21:03:00,154 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:03:00,212 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:03:00,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:03:00,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:03:00,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:03:00,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:03:00,214 INFO L87 Difference]: Start difference. First operand 39473 states and 140838 transitions. Second operand 5 states. [2019-12-27 21:03:00,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:03:00,650 INFO L93 Difference]: Finished difference Result 50748 states and 179051 transitions. [2019-12-27 21:03:00,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:03:00,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 21:03:00,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:03:00,752 INFO L225 Difference]: With dead ends: 50748 [2019-12-27 21:03:00,752 INFO L226 Difference]: Without dead ends: 50737 [2019-12-27 21:03:00,753 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 21:03:00,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50737 states. [2019-12-27 21:03:04,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50737 to 45038. [2019-12-27 21:03:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45038 states. [2019-12-27 21:03:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45038 states to 45038 states and 160086 transitions. [2019-12-27 21:03:04,407 INFO L78 Accepts]: Start accepts. Automaton has 45038 states and 160086 transitions. Word has length 16 [2019-12-27 21:03:04,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:03:04,407 INFO L462 AbstractCegarLoop]: Abstraction has 45038 states and 160086 transitions. [2019-12-27 21:03:04,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:03:04,408 INFO L276 IsEmpty]: Start isEmpty. Operand 45038 states and 160086 transitions. [2019-12-27 21:03:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:03:04,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:03:04,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:03:04,410 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 21:03:04,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:03:04,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1050284482, now seen corresponding path program 1 times [2019-12-27 21:03:04,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:03:04,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975212191] [2019-12-27 21:03:04,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:03:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:03:04,488 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 21:03:04,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975212191] [2019-12-27 21:03:04,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:03:04,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:03:04,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1875958833] [2019-12-27 21:03:04,489 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:03:04,491 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:03:04,496 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 21:03:04,496 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:03:04,511 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:03:04,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:03:04,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:03:04,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:03:04,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:03:04,513 INFO L87 Difference]: Start difference. First operand 45038 states and 160086 transitions. Second operand 5 states. [2019-12-27 21:03:04,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:03:04,968 INFO L93 Difference]: Finished difference Result 54579 states and 192301 transitions. [2019-12-27 21:03:04,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:03:04,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 21:03:04,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:03:05,081 INFO L225 Difference]: With dead ends: 54579 [2019-12-27 21:03:05,081 INFO L226 Difference]: Without dead ends: 54568 [2019-12-27 21:03:05,081 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 21:03:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54568 states. [2019-12-27 21:03:06,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54568 to 44263. [2019-12-27 21:03:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44263 states. [2019-12-27 21:03:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44263 states to 44263 states and 157261 transitions. [2019-12-27 21:03:06,394 INFO L78 Accepts]: Start accepts. Automaton has 44263 states and 157261 transitions. Word has length 16 [2019-12-27 21:03:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:03:06,395 INFO L462 AbstractCegarLoop]: Abstraction has 44263 states and 157261 transitions. [2019-12-27 21:03:06,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:03:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 44263 states and 157261 transitions. [2019-12-27 21:03:06,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 21:03:06,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:03:06,411 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 21:03:06,412 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 21:03:06,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:03:06,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1735803470, now seen corresponding path program 1 times [2019-12-27 21:03:06,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:03:06,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012305950] [2019-12-27 21:03:06,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:03:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:03:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:03:06,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012305950] [2019-12-27 21:03:06,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:03:06,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:03:06,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1875903897] [2019-12-27 21:03:06,518 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:03:06,522 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:03:06,538 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 114 transitions. [2019-12-27 21:03:06,538 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:03:06,556 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:03:06,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:03:06,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:03:06,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:03:06,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:03:06,557 INFO L87 Difference]: Start difference. First operand 44263 states and 157261 transitions. Second operand 6 states. [2019-12-27 21:03:07,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:03:07,257 INFO L93 Difference]: Finished difference Result 64369 states and 224813 transitions. [2019-12-27 21:03:07,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:03:07,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 21:03:07,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:03:07,389 INFO L225 Difference]: With dead ends: 64369 [2019-12-27 21:03:07,390 INFO L226 Difference]: Without dead ends: 64346 [2019-12-27 21:03:07,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:03:07,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64346 states. [2019-12-27 21:03:08,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64346 to 47079. [2019-12-27 21:03:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47079 states. [2019-12-27 21:03:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47079 states to 47079 states and 167291 transitions. [2019-12-27 21:03:08,912 INFO L78 Accepts]: Start accepts. Automaton has 47079 states and 167291 transitions. Word has length 24 [2019-12-27 21:03:08,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:03:08,912 INFO L462 AbstractCegarLoop]: Abstraction has 47079 states and 167291 transitions. [2019-12-27 21:03:08,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:03:08,913 INFO L276 IsEmpty]: Start isEmpty. Operand 47079 states and 167291 transitions. [2019-12-27 21:03:08,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 21:03:08,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:03:08,926 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 21:03:08,926 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 21:03:08,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:03:08,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1241237007, now seen corresponding path program 1 times [2019-12-27 21:03:08,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:03:08,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15610917] [2019-12-27 21:03:08,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:03:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:03:09,000 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 21:03:09,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15610917] [2019-12-27 21:03:09,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:03:09,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:03:09,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2134491029] [2019-12-27 21:03:09,001 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:03:09,005 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:03:09,020 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 114 transitions. [2019-12-27 21:03:09,020 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:03:09,043 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:03:09,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:03:09,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:03:09,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:03:09,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:03:09,045 INFO L87 Difference]: Start difference. First operand 47079 states and 167291 transitions. Second operand 6 states. [2019-12-27 21:03:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:03:09,801 INFO L93 Difference]: Finished difference Result 66062 states and 230201 transitions. [2019-12-27 21:03:09,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:03:09,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 21:03:09,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:03:09,950 INFO L225 Difference]: With dead ends: 66062 [2019-12-27 21:03:09,951 INFO L226 Difference]: Without dead ends: 66039 [2019-12-27 21:03:09,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:03:10,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66039 states. [2019-12-27 21:03:11,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66039 to 43165. [2019-12-27 21:03:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43165 states. [2019-12-27 21:03:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43165 states to 43165 states and 153089 transitions. [2019-12-27 21:03:11,458 INFO L78 Accepts]: Start accepts. Automaton has 43165 states and 153089 transitions. Word has length 24 [2019-12-27 21:03:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:03:11,459 INFO L462 AbstractCegarLoop]: Abstraction has 43165 states and 153089 transitions. [2019-12-27 21:03:11,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:03:11,459 INFO L276 IsEmpty]: Start isEmpty. Operand 43165 states and 153089 transitions. [2019-12-27 21:03:11,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 21:03:11,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:03:11,479 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 21:03:11,480 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 21:03:11,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:03:11,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2135952936, now seen corresponding path program 1 times [2019-12-27 21:03:11,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:03:11,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543783717] [2019-12-27 21:03:11,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:03:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:03:11,530 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 21:03:11,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543783717] [2019-12-27 21:03:11,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:03:11,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:03:11,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1712704060] [2019-12-27 21:03:11,531 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:03:11,535 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:03:11,543 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 40 transitions. [2019-12-27 21:03:11,543 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:03:11,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:03:11,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:03:11,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:03:11,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:03:11,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:03:11,545 INFO L87 Difference]: Start difference. First operand 43165 states and 153089 transitions. Second operand 5 states. [2019-12-27 21:03:11,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:03:11,674 INFO L93 Difference]: Finished difference Result 22104 states and 79422 transitions. [2019-12-27 21:03:11,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:03:11,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 21:03:11,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:03:11,716 INFO L225 Difference]: With dead ends: 22104 [2019-12-27 21:03:11,716 INFO L226 Difference]: Without dead ends: 22104 [2019-12-27 21:03:11,716 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 21:03:11,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22104 states. [2019-12-27 21:03:12,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22104 to 21800. [2019-12-27 21:03:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21800 states. [2019-12-27 21:03:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21800 states to 21800 states and 78390 transitions. [2019-12-27 21:03:12,093 INFO L78 Accepts]: Start accepts. Automaton has 21800 states and 78390 transitions. Word has length 28 [2019-12-27 21:03:12,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:03:12,093 INFO L462 AbstractCegarLoop]: Abstraction has 21800 states and 78390 transitions. [2019-12-27 21:03:12,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:03:12,093 INFO L276 IsEmpty]: Start isEmpty. Operand 21800 states and 78390 transitions. [2019-12-27 21:03:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 21:03:12,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:03:12,131 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 21:03:12,132 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 21:03:12,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:03:12,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1861342996, now seen corresponding path program 1 times [2019-12-27 21:03:12,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:03:12,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233613816] [2019-12-27 21:03:12,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:03:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:03:12,211 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 21:03:12,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233613816] [2019-12-27 21:03:12,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:03:12,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:03:12,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1362844485] [2019-12-27 21:03:12,212 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:03:12,222 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:03:12,279 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 131 states and 238 transitions. [2019-12-27 21:03:12,279 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:03:12,324 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:03:12,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:03:12,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:03:12,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:03:12,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:03:12,325 INFO L87 Difference]: Start difference. First operand 21800 states and 78390 transitions. Second operand 5 states. [2019-12-27 21:03:13,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:03:13,259 INFO L93 Difference]: Finished difference Result 43122 states and 148981 transitions. [2019-12-27 21:03:13,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:03:13,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 21:03:13,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:03:13,351 INFO L225 Difference]: With dead ends: 43122 [2019-12-27 21:03:13,351 INFO L226 Difference]: Without dead ends: 33648 [2019-12-27 21:03:13,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:03:13,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33648 states. [2019-12-27 21:03:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33648 to 22018. [2019-12-27 21:03:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22018 states. [2019-12-27 21:03:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22018 states to 22018 states and 78252 transitions. [2019-12-27 21:03:14,052 INFO L78 Accepts]: Start accepts. Automaton has 22018 states and 78252 transitions. Word has length 42 [2019-12-27 21:03:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:03:14,052 INFO L462 AbstractCegarLoop]: Abstraction has 22018 states and 78252 transitions. [2019-12-27 21:03:14,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:03:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 22018 states and 78252 transitions. [2019-12-27 21:03:14,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 21:03:14,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:03:14,110 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 21:03:14,111 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 21:03:14,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:03:14,111 INFO L82 PathProgramCache]: Analyzing trace with hash 405367934, now seen corresponding path program 2 times [2019-12-27 21:03:14,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:03:14,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307247230] [2019-12-27 21:03:14,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:03:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:03:14,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:03:14,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307247230] [2019-12-27 21:03:14,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:03:14,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:03:14,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1688804509] [2019-12-27 21:03:14,258 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:03:14,267 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:03:14,306 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 104 states and 164 transitions. [2019-12-27 21:03:14,307 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:03:14,320 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:03:14,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:03:14,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:03:14,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:03:14,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:03:14,322 INFO L87 Difference]: Start difference. First operand 22018 states and 78252 transitions. Second operand 5 states. [2019-12-27 21:03:14,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:03:14,995 INFO L93 Difference]: Finished difference Result 33051 states and 116345 transitions. [2019-12-27 21:03:14,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:03:14,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 21:03:14,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:03:15,058 INFO L225 Difference]: With dead ends: 33051 [2019-12-27 21:03:15,058 INFO L226 Difference]: Without dead ends: 33051 [2019-12-27 21:03:15,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:03:15,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33051 states. [2019-12-27 21:03:15,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33051 to 29418. [2019-12-27 21:03:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29418 states. [2019-12-27 21:03:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29418 states to 29418 states and 104572 transitions. [2019-12-27 21:03:15,996 INFO L78 Accepts]: Start accepts. Automaton has 29418 states and 104572 transitions. Word has length 42 [2019-12-27 21:03:15,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:03:15,997 INFO L462 AbstractCegarLoop]: Abstraction has 29418 states and 104572 transitions. [2019-12-27 21:03:15,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:03:15,997 INFO L276 IsEmpty]: Start isEmpty. Operand 29418 states and 104572 transitions. [2019-12-27 21:03:16,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 21:03:16,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:03:16,036 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 21:03:16,037 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 21:03:16,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:03:16,037 INFO L82 PathProgramCache]: Analyzing trace with hash 843263448, now seen corresponding path program 3 times [2019-12-27 21:03:16,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:03:16,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220068896] [2019-12-27 21:03:16,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:03:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:03:16,139 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 21:03:16,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220068896] [2019-12-27 21:03:16,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:03:16,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:03:16,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1148632277] [2019-12-27 21:03:16,140 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:03:16,150 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:03:16,216 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 218 transitions. [2019-12-27 21:03:16,216 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:03:16,289 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:03:16,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:03:16,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:03:16,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:03:16,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:03:16,291 INFO L87 Difference]: Start difference. First operand 29418 states and 104572 transitions. Second operand 8 states. [2019-12-27 21:03:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:03:18,438 INFO L93 Difference]: Finished difference Result 89294 states and 313468 transitions. [2019-12-27 21:03:18,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:03:18,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-12-27 21:03:18,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:03:18,624 INFO L225 Difference]: With dead ends: 89294 [2019-12-27 21:03:18,624 INFO L226 Difference]: Without dead ends: 89294 [2019-12-27 21:03:18,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-12-27 21:03:18,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89294 states. [2019-12-27 21:03:20,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89294 to 33070. [2019-12-27 21:03:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33070 states. [2019-12-27 21:03:20,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33070 states to 33070 states and 118142 transitions. [2019-12-27 21:03:20,183 INFO L78 Accepts]: Start accepts. Automaton has 33070 states and 118142 transitions. Word has length 42 [2019-12-27 21:03:20,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:03:20,183 INFO L462 AbstractCegarLoop]: Abstraction has 33070 states and 118142 transitions. [2019-12-27 21:03:20,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:03:20,184 INFO L276 IsEmpty]: Start isEmpty. Operand 33070 states and 118142 transitions. [2019-12-27 21:03:20,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 21:03:20,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:03:20,244 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 21:03:20,244 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 21:03:20,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:03:20,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1009921150, now seen corresponding path program 4 times [2019-12-27 21:03:20,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:03:20,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264806557] [2019-12-27 21:03:20,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:03:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:03:20,313 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 21:03:20,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264806557] [2019-12-27 21:03:20,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:03:20,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:03:20,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1292666277] [2019-12-27 21:03:20,314 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:03:20,323 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:03:20,376 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 193 transitions. [2019-12-27 21:03:20,376 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:03:20,400 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:03:20,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:03:20,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:03:20,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:03:20,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:03:20,402 INFO L87 Difference]: Start difference. First operand 33070 states and 118142 transitions. Second operand 7 states. [2019-12-27 21:03:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:03:20,766 INFO L93 Difference]: Finished difference Result 32457 states and 116396 transitions. [2019-12-27 21:03:20,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:03:20,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-27 21:03:20,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:03:20,826 INFO L225 Difference]: With dead ends: 32457 [2019-12-27 21:03:20,826 INFO L226 Difference]: Without dead ends: 29968 [2019-12-27 21:03:20,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:03:20,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29968 states. [2019-12-27 21:03:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29968 to 27756. [2019-12-27 21:03:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27756 states. [2019-12-27 21:03:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27756 states to 27756 states and 100349 transitions. [2019-12-27 21:03:21,353 INFO L78 Accepts]: Start accepts. Automaton has 27756 states and 100349 transitions. Word has length 42 [2019-12-27 21:03:21,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:03:21,354 INFO L462 AbstractCegarLoop]: Abstraction has 27756 states and 100349 transitions. [2019-12-27 21:03:21,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:03:21,354 INFO L276 IsEmpty]: Start isEmpty. Operand 27756 states and 100349 transitions. [2019-12-27 21:03:21,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:03:21,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:03:21,393 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 21:03:21,394 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 21:03:21,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:03:21,394 INFO L82 PathProgramCache]: Analyzing trace with hash -876689685, now seen corresponding path program 1 times [2019-12-27 21:03:21,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:03:21,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003935239] [2019-12-27 21:03:21,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:03:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:03:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:03:21,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003935239] [2019-12-27 21:03:21,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:03:21,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:03:21,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1785368324] [2019-12-27 21:03:21,503 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:03:21,524 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:03:22,125 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 256 states and 496 transitions. [2019-12-27 21:03:22,125 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:03:22,141 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:03:22,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:03:22,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:03:22,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:03:22,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:03:22,142 INFO L87 Difference]: Start difference. First operand 27756 states and 100349 transitions. Second operand 5 states. [2019-12-27 21:03:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:03:22,314 INFO L93 Difference]: Finished difference Result 39893 states and 138830 transitions. [2019-12-27 21:03:22,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:03:22,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 21:03:22,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:03:22,335 INFO L225 Difference]: With dead ends: 39893 [2019-12-27 21:03:22,335 INFO L226 Difference]: Without dead ends: 13163 [2019-12-27 21:03:22,336 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 21:03:22,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13163 states. [2019-12-27 21:03:22,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13163 to 13163. [2019-12-27 21:03:22,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13163 states. [2019-12-27 21:03:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13163 states to 13163 states and 41379 transitions. [2019-12-27 21:03:22,533 INFO L78 Accepts]: Start accepts. Automaton has 13163 states and 41379 transitions. Word has length 57 [2019-12-27 21:03:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:03:22,533 INFO L462 AbstractCegarLoop]: Abstraction has 13163 states and 41379 transitions. [2019-12-27 21:03:22,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:03:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 13163 states and 41379 transitions. [2019-12-27 21:03:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:03:22,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:03:22,547 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 21:03:22,547 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 21:03:22,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:03:22,548 INFO L82 PathProgramCache]: Analyzing trace with hash -2087731073, now seen corresponding path program 2 times [2019-12-27 21:03:22,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:03:22,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932465197] [2019-12-27 21:03:22,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:03:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:03:22,635 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 21:03:22,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932465197] [2019-12-27 21:03:22,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:03:22,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:03:22,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [917718602] [2019-12-27 21:03:22,637 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:03:22,655 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:03:22,835 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 174 states and 307 transitions. [2019-12-27 21:03:22,835 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:03:22,905 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 21:03:22,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:03:22,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:03:22,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:03:22,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:03:22,906 INFO L87 Difference]: Start difference. First operand 13163 states and 41379 transitions. Second operand 8 states. [2019-12-27 21:03:24,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:03:24,382 INFO L93 Difference]: Finished difference Result 50029 states and 154454 transitions. [2019-12-27 21:03:24,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 21:03:24,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-27 21:03:24,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:03:24,439 INFO L225 Difference]: With dead ends: 50029 [2019-12-27 21:03:24,439 INFO L226 Difference]: Without dead ends: 37238 [2019-12-27 21:03:24,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-27 21:03:24,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37238 states. [2019-12-27 21:03:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37238 to 15894. [2019-12-27 21:03:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15894 states. [2019-12-27 21:03:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15894 states to 15894 states and 49864 transitions. [2019-12-27 21:03:25,181 INFO L78 Accepts]: Start accepts. Automaton has 15894 states and 49864 transitions. Word has length 57 [2019-12-27 21:03:25,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:03:25,181 INFO L462 AbstractCegarLoop]: Abstraction has 15894 states and 49864 transitions. [2019-12-27 21:03:25,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:03:25,181 INFO L276 IsEmpty]: Start isEmpty. Operand 15894 states and 49864 transitions. [2019-12-27 21:03:25,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:03:25,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:03:25,198 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 21:03:25,198 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 21:03:25,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:03:25,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1765059873, now seen corresponding path program 3 times [2019-12-27 21:03:25,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:03:25,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644963346] [2019-12-27 21:03:25,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:03:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:03:25,292 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 21:03:25,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644963346] [2019-12-27 21:03:25,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:03:25,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:03:25,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [979232758] [2019-12-27 21:03:25,293 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:03:25,330 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:03:25,462 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 165 states and 284 transitions. [2019-12-27 21:03:25,462 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:03:25,510 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:03:25,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:03:25,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:03:25,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:03:25,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:03:25,511 INFO L87 Difference]: Start difference. First operand 15894 states and 49864 transitions. Second operand 7 states. [2019-12-27 21:03:25,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:03:25,935 INFO L93 Difference]: Finished difference Result 39935 states and 123366 transitions. [2019-12-27 21:03:25,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:03:25,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 21:03:25,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:03:25,980 INFO L225 Difference]: With dead ends: 39935 [2019-12-27 21:03:25,980 INFO L226 Difference]: Without dead ends: 28119 [2019-12-27 21:03:25,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:03:26,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28119 states. [2019-12-27 21:03:26,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28119 to 18561. [2019-12-27 21:03:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18561 states. [2019-12-27 21:03:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18561 states to 18561 states and 57996 transitions. [2019-12-27 21:03:26,370 INFO L78 Accepts]: Start accepts. Automaton has 18561 states and 57996 transitions. Word has length 57 [2019-12-27 21:03:26,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:03:26,370 INFO L462 AbstractCegarLoop]: Abstraction has 18561 states and 57996 transitions. [2019-12-27 21:03:26,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:03:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand 18561 states and 57996 transitions. [2019-12-27 21:03:26,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:03:26,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:03:26,392 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 21:03:26,392 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 21:03:26,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:03:26,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1957634753, now seen corresponding path program 4 times [2019-12-27 21:03:26,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:03:26,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216821159] [2019-12-27 21:03:26,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:03:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:03:26,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:03:26,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216821159] [2019-12-27 21:03:26,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:03:26,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:03:26,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [249716791] [2019-12-27 21:03:26,537 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:03:26,556 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:03:27,038 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 287 transitions. [2019-12-27 21:03:27,039 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:03:27,093 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:03:27,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:03:27,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:03:27,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:03:27,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:03:27,094 INFO L87 Difference]: Start difference. First operand 18561 states and 57996 transitions. Second operand 9 states. [2019-12-27 21:03:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:03:29,166 INFO L93 Difference]: Finished difference Result 123280 states and 395035 transitions. [2019-12-27 21:03:29,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 21:03:29,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 21:03:29,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:03:29,353 INFO L225 Difference]: With dead ends: 123280 [2019-12-27 21:03:29,354 INFO L226 Difference]: Without dead ends: 102372 [2019-12-27 21:03:29,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=454, Invalid=1616, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 21:03:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102372 states. [2019-12-27 21:03:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102372 to 26752. [2019-12-27 21:03:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26752 states. [2019-12-27 21:03:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26752 states to 26752 states and 85164 transitions. [2019-12-27 21:03:30,394 INFO L78 Accepts]: Start accepts. Automaton has 26752 states and 85164 transitions. Word has length 57 [2019-12-27 21:03:30,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:03:30,394 INFO L462 AbstractCegarLoop]: Abstraction has 26752 states and 85164 transitions. [2019-12-27 21:03:30,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:03:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 26752 states and 85164 transitions. [2019-12-27 21:03:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:03:30,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:03:30,426 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 21:03:30,426 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 21:03:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:03:30,426 INFO L82 PathProgramCache]: Analyzing trace with hash -972735375, now seen corresponding path program 5 times [2019-12-27 21:03:30,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:03:30,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640746565] [2019-12-27 21:03:30,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:03:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:03:30,549 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 21:03:30,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640746565] [2019-12-27 21:03:30,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:03:30,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:03:30,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1064195553] [2019-12-27 21:03:30,553 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:03:30,569 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:03:31,019 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 165 states and 287 transitions. [2019-12-27 21:03:31,020 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:03:31,284 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 21:03:31,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:03:31,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:03:31,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:03:31,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:03:31,285 INFO L87 Difference]: Start difference. First operand 26752 states and 85164 transitions. Second operand 11 states. [2019-12-27 21:03:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:03:35,388 INFO L93 Difference]: Finished difference Result 145451 states and 454786 transitions. [2019-12-27 21:03:35,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-27 21:03:35,388 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-12-27 21:03:35,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:03:35,603 INFO L225 Difference]: With dead ends: 145451 [2019-12-27 21:03:35,604 INFO L226 Difference]: Without dead ends: 122416 [2019-12-27 21:03:35,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 17 SyntacticMatches, 9 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1626 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=976, Invalid=3716, Unknown=0, NotChecked=0, Total=4692 [2019-12-27 21:03:35,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122416 states. [2019-12-27 21:03:37,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122416 to 28406. [2019-12-27 21:03:37,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28406 states. [2019-12-27 21:03:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28406 states to 28406 states and 90706 transitions. [2019-12-27 21:03:37,433 INFO L78 Accepts]: Start accepts. Automaton has 28406 states and 90706 transitions. Word has length 57 [2019-12-27 21:03:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:03:37,433 INFO L462 AbstractCegarLoop]: Abstraction has 28406 states and 90706 transitions. [2019-12-27 21:03:37,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:03:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 28406 states and 90706 transitions. [2019-12-27 21:03:37,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:03:37,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:03:37,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:03:37,466 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 21:03:37,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:03:37,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1404679823, now seen corresponding path program 6 times [2019-12-27 21:03:37,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:03:37,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936423331] [2019-12-27 21:03:37,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:03:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:03:37,538 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 21:03:37,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936423331] [2019-12-27 21:03:37,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:03:37,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:03:37,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1787692620] [2019-12-27 21:03:37,539 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:03:37,555 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:03:37,724 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 268 transitions. [2019-12-27 21:03:37,724 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:03:37,733 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:03:37,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:03:37,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:03:37,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:03:37,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:03:37,734 INFO L87 Difference]: Start difference. First operand 28406 states and 90706 transitions. Second operand 4 states. [2019-12-27 21:03:38,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:03:38,007 INFO L93 Difference]: Finished difference Result 30233 states and 93847 transitions. [2019-12-27 21:03:38,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:03:38,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-27 21:03:38,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:03:38,054 INFO L225 Difference]: With dead ends: 30233 [2019-12-27 21:03:38,054 INFO L226 Difference]: Without dead ends: 30233 [2019-12-27 21:03:38,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 21:03:38,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30233 states. [2019-12-27 21:03:38,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30233 to 22639. [2019-12-27 21:03:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22639 states. [2019-12-27 21:03:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22639 states to 22639 states and 70624 transitions. [2019-12-27 21:03:38,450 INFO L78 Accepts]: Start accepts. Automaton has 22639 states and 70624 transitions. Word has length 57 [2019-12-27 21:03:38,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:03:38,450 INFO L462 AbstractCegarLoop]: Abstraction has 22639 states and 70624 transitions. [2019-12-27 21:03:38,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:03:38,451 INFO L276 IsEmpty]: Start isEmpty. Operand 22639 states and 70624 transitions. [2019-12-27 21:03:38,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:03:38,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:03:38,474 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 21:03:38,474 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 21:03:38,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:03:38,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2094949333, now seen corresponding path program 1 times [2019-12-27 21:03:38,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:03:38,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380542502] [2019-12-27 21:03:38,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:03:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:03:38,651 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 21:03:38,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380542502] [2019-12-27 21:03:38,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:03:38,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:03:38,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1033508249] [2019-12-27 21:03:38,652 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:03:38,669 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:03:39,115 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 208 transitions. [2019-12-27 21:03:39,116 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:03:39,149 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:03:39,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:03:39,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:03:39,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:03:39,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:03:39,151 INFO L87 Difference]: Start difference. First operand 22639 states and 70624 transitions. Second operand 11 states. [2019-12-27 21:03:41,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:03:41,328 INFO L93 Difference]: Finished difference Result 39463 states and 121412 transitions. [2019-12-27 21:03:41,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 21:03:41,328 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-27 21:03:41,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:03:41,378 INFO L225 Difference]: With dead ends: 39463 [2019-12-27 21:03:41,378 INFO L226 Difference]: Without dead ends: 29290 [2019-12-27 21:03:41,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2019-12-27 21:03:41,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29290 states. [2019-12-27 21:03:41,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29290 to 23457. [2019-12-27 21:03:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23457 states. [2019-12-27 21:03:41,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23457 states to 23457 states and 72682 transitions. [2019-12-27 21:03:41,781 INFO L78 Accepts]: Start accepts. Automaton has 23457 states and 72682 transitions. Word has length 58 [2019-12-27 21:03:41,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:03:41,781 INFO L462 AbstractCegarLoop]: Abstraction has 23457 states and 72682 transitions. [2019-12-27 21:03:41,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:03:41,781 INFO L276 IsEmpty]: Start isEmpty. Operand 23457 states and 72682 transitions. [2019-12-27 21:03:41,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:03:41,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:03:41,810 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 21:03:41,810 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 21:03:41,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:03:41,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1493656171, now seen corresponding path program 2 times [2019-12-27 21:03:41,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:03:41,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303080847] [2019-12-27 21:03:41,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:03:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:03:41,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 21:03:41,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303080847] [2019-12-27 21:03:41,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:03:41,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:03:41,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [68742626] [2019-12-27 21:03:41,984 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:03:42,001 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:03:42,157 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 207 transitions. [2019-12-27 21:03:42,157 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:03:42,337 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:03:42,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:03:42,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:03:42,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:03:42,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:03:42,339 INFO L87 Difference]: Start difference. First operand 23457 states and 72682 transitions. Second operand 13 states. [2019-12-27 21:03:49,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:03:49,382 INFO L93 Difference]: Finished difference Result 76668 states and 232332 transitions. [2019-12-27 21:03:49,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-12-27 21:03:49,383 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2019-12-27 21:03:49,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:03:49,506 INFO L225 Difference]: With dead ends: 76668 [2019-12-27 21:03:49,507 INFO L226 Difference]: Without dead ends: 76506 [2019-12-27 21:03:49,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1853 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1050, Invalid=4500, Unknown=0, NotChecked=0, Total=5550 [2019-12-27 21:03:49,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76506 states. [2019-12-27 21:03:50,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76506 to 30479. [2019-12-27 21:03:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30479 states. [2019-12-27 21:03:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30479 states to 30479 states and 95378 transitions. [2019-12-27 21:03:50,383 INFO L78 Accepts]: Start accepts. Automaton has 30479 states and 95378 transitions. Word has length 58 [2019-12-27 21:03:50,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:03:50,383 INFO L462 AbstractCegarLoop]: Abstraction has 30479 states and 95378 transitions. [2019-12-27 21:03:50,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:03:50,383 INFO L276 IsEmpty]: Start isEmpty. Operand 30479 states and 95378 transitions. [2019-12-27 21:03:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:03:50,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:03:50,422 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 21:03:50,422 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 21:03:50,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:03:50,423 INFO L82 PathProgramCache]: Analyzing trace with hash 979167810, now seen corresponding path program 1 times [2019-12-27 21:03:50,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:03:50,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250037916] [2019-12-27 21:03:50,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:03:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:03:50,467 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 21:03:50,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250037916] [2019-12-27 21:03:50,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:03:50,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:03:50,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [409354470] [2019-12-27 21:03:50,468 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:03:50,485 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:03:50,611 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 204 transitions. [2019-12-27 21:03:50,611 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:03:50,626 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:03:50,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:03:50,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:03:50,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:03:50,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:03:50,627 INFO L87 Difference]: Start difference. First operand 30479 states and 95378 transitions. Second operand 4 states. [2019-12-27 21:03:51,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:03:51,169 INFO L93 Difference]: Finished difference Result 32840 states and 100539 transitions. [2019-12-27 21:03:51,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:03:51,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-27 21:03:51,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:03:51,217 INFO L225 Difference]: With dead ends: 32840 [2019-12-27 21:03:51,217 INFO L226 Difference]: Without dead ends: 32840 [2019-12-27 21:03:51,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:03:51,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32840 states. [2019-12-27 21:03:51,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32840 to 23254. [2019-12-27 21:03:51,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23254 states. [2019-12-27 21:03:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23254 states to 23254 states and 71471 transitions. [2019-12-27 21:03:51,642 INFO L78 Accepts]: Start accepts. Automaton has 23254 states and 71471 transitions. Word has length 58 [2019-12-27 21:03:51,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:03:51,642 INFO L462 AbstractCegarLoop]: Abstraction has 23254 states and 71471 transitions. [2019-12-27 21:03:51,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:03:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 23254 states and 71471 transitions. [2019-12-27 21:03:51,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:03:51,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:03:51,669 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 21:03:51,669 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 21:03:51,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:03:51,669 INFO L82 PathProgramCache]: Analyzing trace with hash -194995515, now seen corresponding path program 3 times [2019-12-27 21:03:51,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:03:51,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681856165] [2019-12-27 21:03:51,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:03:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:03:51,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:03:51,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681856165] [2019-12-27 21:03:51,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:03:51,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:03:51,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1426792190] [2019-12-27 21:03:51,855 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:03:51,872 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:03:52,050 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 218 states and 413 transitions. [2019-12-27 21:03:52,051 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:03:52,162 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 21:03:52,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:03:52,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:03:52,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:03:52,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:03:52,164 INFO L87 Difference]: Start difference. First operand 23254 states and 71471 transitions. Second operand 11 states. [2019-12-27 21:03:54,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:03:54,044 INFO L93 Difference]: Finished difference Result 42101 states and 127801 transitions. [2019-12-27 21:03:54,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 21:03:54,044 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-27 21:03:54,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:03:54,103 INFO L225 Difference]: With dead ends: 42101 [2019-12-27 21:03:54,103 INFO L226 Difference]: Without dead ends: 37969 [2019-12-27 21:03:54,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2019-12-27 21:03:54,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37969 states. [2019-12-27 21:03:54,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37969 to 23631. [2019-12-27 21:03:54,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23631 states. [2019-12-27 21:03:54,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23631 states to 23631 states and 72359 transitions. [2019-12-27 21:03:54,560 INFO L78 Accepts]: Start accepts. Automaton has 23631 states and 72359 transitions. Word has length 58 [2019-12-27 21:03:54,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:03:54,560 INFO L462 AbstractCegarLoop]: Abstraction has 23631 states and 72359 transitions. [2019-12-27 21:03:54,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:03:54,561 INFO L276 IsEmpty]: Start isEmpty. Operand 23631 states and 72359 transitions. [2019-12-27 21:03:54,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:03:54,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:03:54,584 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 21:03:54,584 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 21:03:54,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:03:54,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1426069175, now seen corresponding path program 4 times [2019-12-27 21:03:54,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:03:54,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663329835] [2019-12-27 21:03:54,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:03:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:03:54,756 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 21:03:54,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663329835] [2019-12-27 21:03:54,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:03:54,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:03:54,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [23157308] [2019-12-27 21:03:54,757 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:03:54,774 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:03:55,323 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 224 states and 430 transitions. [2019-12-27 21:03:55,323 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:03:55,632 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 21:03:55,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 21:03:55,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:03:55,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 21:03:55,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:03:55,633 INFO L87 Difference]: Start difference. First operand 23631 states and 72359 transitions. Second operand 14 states. [2019-12-27 21:04:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:04:00,472 INFO L93 Difference]: Finished difference Result 65656 states and 197627 transitions. [2019-12-27 21:04:00,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 21:04:00,473 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-12-27 21:04:00,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:04:00,565 INFO L225 Difference]: With dead ends: 65656 [2019-12-27 21:04:00,566 INFO L226 Difference]: Without dead ends: 58781 [2019-12-27 21:04:00,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 8 SyntacticMatches, 10 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=349, Invalid=1721, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 21:04:00,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58781 states. [2019-12-27 21:04:01,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58781 to 24013. [2019-12-27 21:04:01,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24013 states. [2019-12-27 21:04:01,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24013 states to 24013 states and 73564 transitions. [2019-12-27 21:04:01,208 INFO L78 Accepts]: Start accepts. Automaton has 24013 states and 73564 transitions. Word has length 58 [2019-12-27 21:04:01,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:04:01,208 INFO L462 AbstractCegarLoop]: Abstraction has 24013 states and 73564 transitions. [2019-12-27 21:04:01,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 21:04:01,208 INFO L276 IsEmpty]: Start isEmpty. Operand 24013 states and 73564 transitions. [2019-12-27 21:04:01,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:04:01,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:04:01,233 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 21:04:01,234 INFO L410 AbstractCegarLoop]: === Iteration 25 === [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 21:04:01,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:04:01,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1166224889, now seen corresponding path program 5 times [2019-12-27 21:04:01,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:04:01,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234857753] [2019-12-27 21:04:01,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:04:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:04:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:04:01,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234857753] [2019-12-27 21:04:01,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:04:01,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:04:01,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [99891908] [2019-12-27 21:04:01,281 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:04:01,297 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:04:01,845 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 199 states and 370 transitions. [2019-12-27 21:04:01,846 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:04:01,847 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:04:01,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:04:01,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:04:01,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:04:01,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:04:01,848 INFO L87 Difference]: Start difference. First operand 24013 states and 73564 transitions. Second operand 3 states. [2019-12-27 21:04:01,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:04:01,997 INFO L93 Difference]: Finished difference Result 24011 states and 73559 transitions. [2019-12-27 21:04:01,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:04:01,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 21:04:01,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:04:02,049 INFO L225 Difference]: With dead ends: 24011 [2019-12-27 21:04:02,050 INFO L226 Difference]: Without dead ends: 24011 [2019-12-27 21:04:02,050 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 21:04:02,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24011 states. [2019-12-27 21:04:02,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24011 to 21123. [2019-12-27 21:04:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21123 states. [2019-12-27 21:04:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21123 states to 21123 states and 65070 transitions. [2019-12-27 21:04:02,454 INFO L78 Accepts]: Start accepts. Automaton has 21123 states and 65070 transitions. Word has length 58 [2019-12-27 21:04:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:04:02,454 INFO L462 AbstractCegarLoop]: Abstraction has 21123 states and 65070 transitions. [2019-12-27 21:04:02,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:04:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand 21123 states and 65070 transitions. [2019-12-27 21:04:02,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:04:02,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:04:02,476 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 21:04:02,476 INFO L410 AbstractCegarLoop]: === Iteration 26 === [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 21:04:02,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:04:02,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1551913972, now seen corresponding path program 1 times [2019-12-27 21:04:02,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:04:02,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316206007] [2019-12-27 21:04:02,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:04:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:04:02,641 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 21:04:02,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316206007] [2019-12-27 21:04:02,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:04:02,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:04:02,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1350536049] [2019-12-27 21:04:02,642 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:04:02,659 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:04:02,759 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 208 transitions. [2019-12-27 21:04:02,759 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:04:02,838 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:04:02,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:04:02,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:04:02,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:04:02,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:04:02,840 INFO L87 Difference]: Start difference. First operand 21123 states and 65070 transitions. Second operand 12 states. [2019-12-27 21:04:05,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:04:05,148 INFO L93 Difference]: Finished difference Result 37234 states and 113116 transitions. [2019-12-27 21:04:05,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 21:04:05,148 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-27 21:04:05,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:04:05,205 INFO L225 Difference]: With dead ends: 37234 [2019-12-27 21:04:05,205 INFO L226 Difference]: Without dead ends: 36228 [2019-12-27 21:04:05,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2019-12-27 21:04:05,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36228 states. [2019-12-27 21:04:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36228 to 21457. [2019-12-27 21:04:05,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21457 states. [2019-12-27 21:04:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21457 states to 21457 states and 65973 transitions. [2019-12-27 21:04:05,634 INFO L78 Accepts]: Start accepts. Automaton has 21457 states and 65973 transitions. Word has length 59 [2019-12-27 21:04:05,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:04:05,634 INFO L462 AbstractCegarLoop]: Abstraction has 21457 states and 65973 transitions. [2019-12-27 21:04:05,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:04:05,634 INFO L276 IsEmpty]: Start isEmpty. Operand 21457 states and 65973 transitions. [2019-12-27 21:04:05,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:04:05,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:04:05,655 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 21:04:05,656 INFO L410 AbstractCegarLoop]: === Iteration 27 === [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 21:04:05,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:04:05,656 INFO L82 PathProgramCache]: Analyzing trace with hash -597490960, now seen corresponding path program 2 times [2019-12-27 21:04:05,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:04:05,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244570473] [2019-12-27 21:04:05,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:04:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:04:05,828 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 21:04:05,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244570473] [2019-12-27 21:04:05,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:04:05,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:04:05,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [304479807] [2019-12-27 21:04:05,829 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:04:05,947 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:04:06,098 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 209 transitions. [2019-12-27 21:04:06,098 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:04:06,635 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 21:04:06,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 21:04:06,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:04:06,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 21:04:06,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-27 21:04:06,637 INFO L87 Difference]: Start difference. First operand 21457 states and 65973 transitions. Second operand 18 states. [2019-12-27 21:04:07,413 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-27 21:04:07,620 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-27 21:04:07,881 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-27 21:04:08,959 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-27 21:04:13,016 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-27 21:04:17,411 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-27 21:04:19,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:04:19,619 INFO L93 Difference]: Finished difference Result 81337 states and 244648 transitions. [2019-12-27 21:04:19,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-12-27 21:04:19,620 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2019-12-27 21:04:19,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:04:19,741 INFO L225 Difference]: With dead ends: 81337 [2019-12-27 21:04:19,741 INFO L226 Difference]: Without dead ends: 79699 [2019-12-27 21:04:19,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8966 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2641, Invalid=20311, Unknown=0, NotChecked=0, Total=22952 [2019-12-27 21:04:19,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79699 states. [2019-12-27 21:04:20,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79699 to 27491. [2019-12-27 21:04:20,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27491 states. [2019-12-27 21:04:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27491 states to 27491 states and 84535 transitions. [2019-12-27 21:04:20,578 INFO L78 Accepts]: Start accepts. Automaton has 27491 states and 84535 transitions. Word has length 59 [2019-12-27 21:04:20,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:04:20,578 INFO L462 AbstractCegarLoop]: Abstraction has 27491 states and 84535 transitions. [2019-12-27 21:04:20,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 21:04:20,579 INFO L276 IsEmpty]: Start isEmpty. Operand 27491 states and 84535 transitions. [2019-12-27 21:04:20,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:04:20,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:04:20,610 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 21:04:20,610 INFO L410 AbstractCegarLoop]: === Iteration 28 === [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 21:04:20,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:04:20,610 INFO L82 PathProgramCache]: Analyzing trace with hash 982633720, now seen corresponding path program 3 times [2019-12-27 21:04:20,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:04:20,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640352321] [2019-12-27 21:04:20,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:04:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:04:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:04:20,734 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:04:20,734 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:04:20,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] ULTIMATE.startENTRY-->L850: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (and (= 0 v_~y$w_buff1~0_28) (= 0 v_~a~0_9) (= v_~x~0_11 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t957~0.base_18|) (= v_~main$tmp_guard1~0_18 0) (= 0 v_~y$r_buff1_thd3~0_20) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff0_thd1~0_11 0) (= v_~y~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~__unbuffered_p0_EAX~0_15) (= v_~y$read_delayed~0_7 0) (= |v_#NULL.offset_3| 0) (= 0 v_~__unbuffered_p3_EAX~0_14) (= v_~y$w_buff0_used~0_109 0) (= 0 v_~y$flush_delayed~0_14) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t957~0.base_18| 4) |v_#length_29|) (= v_~y$r_buff0_thd2~0_72 0) (= v_~b~0_11 0) (= 0 v_~y$r_buff1_thd0~0_24) (= v_~y$r_buff0_thd0~0_22 0) (= v_~y$mem_tmp~0_11 0) (= 0 v_~y$w_buff0~0_29) (= v_~y$r_buff0_thd4~0_21 0) (= 0 v_~__unbuffered_p2_EAX~0_16) (= 0 v_~y$r_buff1_thd1~0_11) (= |v_ULTIMATE.start_main_~#t957~0.offset_15| 0) (= v_~y$w_buff1_used~0_68 0) (= 0 v_~y$r_buff1_thd2~0_44) (= 0 v_~__unbuffered_cnt~0_24) (< 0 |v_#StackHeapBarrier_20|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t957~0.base_18|)) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t957~0.base_18| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t957~0.base_18|) |v_ULTIMATE.start_main_~#t957~0.offset_15| 0)) |v_#memory_int_27|) (= |v_#valid_68| (store .cse0 |v_ULTIMATE.start_main_~#t957~0.base_18| 1)) (= 0 v_~__unbuffered_p3_EBX~0_14) (= 0 |v_#NULL.base_3|) (= 0 v_~y$read_delayed_var~0.base_8) (= v_~z~0_12 0) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~weak$$choice2~0_31) (= 0 v_~y$r_buff1_thd4~0_20) (= v_~y$r_buff0_thd3~0_29 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_23|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start_main_~#t959~0.base=|v_ULTIMATE.start_main_~#t959~0.base_22|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_9, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ULTIMATE.start_main_~#t959~0.offset=|v_ULTIMATE.start_main_~#t959~0.offset_17|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_8|, ULTIMATE.start_main_~#t960~0.base=|v_ULTIMATE.start_main_~#t960~0.base_20|, ULTIMATE.start_main_~#t960~0.offset=|v_ULTIMATE.start_main_~#t960~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_72, ULTIMATE.start_main_~#t957~0.offset=|v_ULTIMATE.start_main_~#t957~0.offset_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_11, ~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_109, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_~#t958~0.offset=|v_ULTIMATE.start_main_~#t958~0.offset_17|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ULTIMATE.start_main_~#t958~0.base=|v_ULTIMATE.start_main_~#t958~0.base_21|, ~y~0=v_~y~0_25, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_44, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~b~0=v_~b~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_31, ULTIMATE.start_main_~#t957~0.base=|v_ULTIMATE.start_main_~#t957~0.base_18|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t959~0.base, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t959~0.offset, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t960~0.base, ULTIMATE.start_main_~#t960~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t957~0.offset, 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_~#t958~0.offset, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t958~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, ~b~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t957~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:04:20,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L850-1-->L852: Formula: (and (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t958~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t958~0.base_12| 0)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t958~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t958~0.offset_11|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t958~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t958~0.base_12|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t958~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t958~0.base_12|) |v_ULTIMATE.start_main_~#t958~0.offset_11| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t958~0.base=|v_ULTIMATE.start_main_~#t958~0.base_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_21|, ULTIMATE.start_main_~#t958~0.offset=|v_ULTIMATE.start_main_~#t958~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t958~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t958~0.offset] because there is no mapped edge [2019-12-27 21:04:20,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L852-1-->L854: Formula: (and (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t959~0.base_13| 1) |v_#valid_40|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t959~0.base_13| 4) |v_#length_19|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t959~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t959~0.offset_11|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t959~0.base_13|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t959~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t959~0.base_13|) |v_ULTIMATE.start_main_~#t959~0.offset_11| 2)) |v_#memory_int_17|) (not (= |v_ULTIMATE.start_main_~#t959~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t959~0.offset=|v_ULTIMATE.start_main_~#t959~0.offset_11|, ULTIMATE.start_main_~#t959~0.base=|v_ULTIMATE.start_main_~#t959~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t959~0.offset, ULTIMATE.start_main_~#t959~0.base] because there is no mapped edge [2019-12-27 21:04:20,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L4-->L801: Formula: (and (= v_~__unbuffered_p2_EAX~0_5 v_~z~0_6) (= v_~y$r_buff0_thd0~0_16 v_~y$r_buff1_thd0~0_12) (= v_~y$r_buff0_thd3~0_19 v_~y$r_buff1_thd3~0_13) (= v_~y$r_buff0_thd4~0_16 v_~y$r_buff1_thd4~0_14) (= v_~y$r_buff0_thd3~0_18 1) (= v_~y$r_buff0_thd2~0_53 v_~y$r_buff1_thd2~0_29) (= v_~y$r_buff1_thd1~0_5 v_~y$r_buff0_thd1~0_5) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_16, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_19, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_5, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6, ~z~0=v_~z~0_6} OutVars{P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_29, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_16, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_5, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_14, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_5, ~z~0=v_~z~0_6, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_12} 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, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 21:04:20,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L854-1-->L856: Formula: (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t960~0.base_12|) (= |v_ULTIMATE.start_main_~#t960~0.offset_10| 0) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t960~0.base_12| 1)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t960~0.base_12|) 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t960~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t960~0.base_12|) |v_ULTIMATE.start_main_~#t960~0.offset_10| 3))) (not (= 0 |v_ULTIMATE.start_main_~#t960~0.base_12|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t960~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t960~0.base=|v_ULTIMATE.start_main_~#t960~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t960~0.offset=|v_ULTIMATE.start_main_~#t960~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t960~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t960~0.offset] because there is no mapped edge [2019-12-27 21:04:20,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_4 |v_P0Thread1of1ForFork1_#in~arg.base_4|) (= v_P0Thread1of1ForFork1_~arg.offset_4 |v_P0Thread1of1ForFork1_#in~arg.offset_4|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~b~0_5) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_5) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, ~x~0=v_~x~0_5} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~b~0=v_~b~0_5, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, ~x~0=v_~x~0_5, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 21:04:20,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L827-2-->L827-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In-1698835617 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1698835617 256) 0)) (.cse1 (= |P3Thread1of1ForFork0_#t~ite33_Out-1698835617| |P3Thread1of1ForFork0_#t~ite32_Out-1698835617|))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In-1698835617 |P3Thread1of1ForFork0_#t~ite32_Out-1698835617|)) (and (or .cse0 .cse2) .cse1 (= |P3Thread1of1ForFork0_#t~ite32_Out-1698835617| ~y~0_In-1698835617)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1698835617, ~y$w_buff1~0=~y$w_buff1~0_In-1698835617, ~y~0=~y~0_In-1698835617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1698835617} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1698835617, ~y$w_buff1~0=~y$w_buff1~0_In-1698835617, ~y~0=~y~0_In-1698835617, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-1698835617|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-1698835617|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1698835617} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 21:04:20,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-982880399 256))) (.cse0 (= (mod ~y$r_buff0_thd4~0_In-982880399 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out-982880399| ~y$w_buff0_used~0_In-982880399)) (and (= 0 |P3Thread1of1ForFork0_#t~ite34_Out-982880399|) (not .cse1) (not .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-982880399, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-982880399} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-982880399, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-982880399, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-982880399|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-27 21:04:20,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In213025910 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In213025910 256) 0))) (or (and (= ~y$w_buff0_used~0_In213025910 |P2Thread1of1ForFork3_#t~ite28_Out213025910|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork3_#t~ite28_Out213025910| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In213025910, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In213025910} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In213025910, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In213025910, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out213025910|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-27 21:04:20,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L829-->L829-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd4~0_In-1816884098 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1816884098 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd4~0_In-1816884098 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1816884098 256)))) (or (and (= 0 |P3Thread1of1ForFork0_#t~ite35_Out-1816884098|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork0_#t~ite35_Out-1816884098| ~y$w_buff1_used~0_In-1816884098) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1816884098, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1816884098, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1816884098, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1816884098} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1816884098, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1816884098, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1816884098, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-1816884098|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1816884098} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-27 21:04:20,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L803-->L803-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 (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-2040053776|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-2040053776 |P2Thread1of1ForFork3_#t~ite29_Out-2040053776|) (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~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-2040053776|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2040053776} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-27 21:04:20,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L804-->L805: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1510490370 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1510490370 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-1510490370)) (and (= ~y$r_buff0_thd3~0_In-1510490370 ~y$r_buff0_thd3~0_Out-1510490370) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1510490370, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1510490370} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-1510490370|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1510490370, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1510490370} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 21:04:20,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L805-->L805-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-517342361 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-517342361 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-517342361 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-517342361 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite31_Out-517342361| ~y$r_buff1_thd3~0_In-517342361) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork3_#t~ite31_Out-517342361| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-517342361, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-517342361, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-517342361, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-517342361} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-517342361, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-517342361, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-517342361, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-517342361|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-517342361} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-27 21:04:20,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L805-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= |v_P2Thread1of1ForFork3_#t~ite31_8| v_~y$r_buff1_thd3~0_14) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, 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 21:04:20,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In666020483 256)))) (or (and .cse0 (= ~y$w_buff0~0_In666020483 |P1Thread1of1ForFork2_#t~ite8_Out666020483|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In666020483 256)))) (or (= (mod ~y$w_buff0_used~0_In666020483 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In666020483 256) 0)) (and (= (mod ~y$w_buff1_used~0_In666020483 256) 0) .cse1))) (= |P1Thread1of1ForFork2_#t~ite9_Out666020483| |P1Thread1of1ForFork2_#t~ite8_Out666020483|)) (and (not .cse0) (= ~y$w_buff0~0_In666020483 |P1Thread1of1ForFork2_#t~ite9_Out666020483|) (= |P1Thread1of1ForFork2_#t~ite8_In666020483| |P1Thread1of1ForFork2_#t~ite8_Out666020483|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In666020483, ~y$w_buff0_used~0=~y$w_buff0_used~0_In666020483, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In666020483|, ~y$w_buff0~0=~y$w_buff0~0_In666020483, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In666020483, ~weak$$choice2~0=~weak$$choice2~0_In666020483, ~y$w_buff1_used~0=~y$w_buff1_used~0_In666020483} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In666020483, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out666020483|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In666020483, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out666020483|, ~y$w_buff0~0=~y$w_buff0~0_In666020483, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In666020483, ~weak$$choice2~0=~weak$$choice2~0_In666020483, ~y$w_buff1_used~0=~y$w_buff1_used~0_In666020483} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:04:20,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2024639519 256)))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite11_Out-2024639519| ~y$w_buff1~0_In-2024639519) (= |P1Thread1of1ForFork2_#t~ite11_Out-2024639519| |P1Thread1of1ForFork2_#t~ite12_Out-2024639519|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-2024639519 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-2024639519 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-2024639519 256)) .cse1) (and (= (mod ~y$w_buff1_used~0_In-2024639519 256) 0) .cse1)))) (and (not .cse0) (= ~y$w_buff1~0_In-2024639519 |P1Thread1of1ForFork2_#t~ite12_Out-2024639519|) (= |P1Thread1of1ForFork2_#t~ite11_In-2024639519| |P1Thread1of1ForFork2_#t~ite11_Out-2024639519|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2024639519, ~y$w_buff1~0=~y$w_buff1~0_In-2024639519, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2024639519, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2024639519, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-2024639519|, ~weak$$choice2~0=~weak$$choice2~0_In-2024639519, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2024639519} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2024639519, ~y$w_buff1~0=~y$w_buff1~0_In-2024639519, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2024639519, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2024639519, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-2024639519|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-2024639519|, ~weak$$choice2~0=~weak$$choice2~0_In-2024639519, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2024639519} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 21:04:20,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L769-->L770: Formula: (and (= v_~y$r_buff0_thd2~0_56 v_~y$r_buff0_thd2~0_55) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_9|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20} 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 21:04:20,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L770-->L770-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-732280209 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-732280209 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-732280209 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-732280209 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In-732280209 256)) .cse0))) (= |P1Thread1of1ForFork2_#t~ite23_Out-732280209| ~y$r_buff1_thd2~0_In-732280209) (= |P1Thread1of1ForFork2_#t~ite23_Out-732280209| |P1Thread1of1ForFork2_#t~ite24_Out-732280209|) .cse1) (and (= |P1Thread1of1ForFork2_#t~ite23_In-732280209| |P1Thread1of1ForFork2_#t~ite23_Out-732280209|) (= |P1Thread1of1ForFork2_#t~ite24_Out-732280209| ~y$r_buff1_thd2~0_In-732280209) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-732280209, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-732280209, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-732280209, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-732280209|, ~weak$$choice2~0=~weak$$choice2~0_In-732280209, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-732280209} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-732280209, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-732280209, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-732280209, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-732280209|, ~weak$$choice2~0=~weak$$choice2~0_In-732280209, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-732280209|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-732280209} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 21:04:20,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L772-->L780: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_17 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_17, 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 21:04:20,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2115090384 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-2115090384 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out-2115090384| ~y$r_buff0_thd4~0_In-2115090384)) (and (not .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out-2115090384| 0) (not .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-2115090384, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2115090384} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-2115090384, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2115090384, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-2115090384|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-27 21:04:20,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-2133861002 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2133861002 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd4~0_In-2133861002 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2133861002 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite37_Out-2133861002| ~y$r_buff1_thd4~0_In-2133861002) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork0_#t~ite37_Out-2133861002|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-2133861002, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-2133861002, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2133861002, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2133861002} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-2133861002, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-2133861002, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2133861002, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-2133861002|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2133861002} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-27 21:04:20,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L831-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_8| v_~y$r_buff1_thd4~0_15) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_15, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} 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 21:04:20,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L856-1-->L862: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:04:20,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L862-2-->L862-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In770776972 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In770776972 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out770776972| ~y$w_buff1~0_In770776972) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out770776972| ~y~0_In770776972) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In770776972, ~y~0=~y~0_In770776972, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In770776972, ~y$w_buff1_used~0=~y$w_buff1_used~0_In770776972} OutVars{~y$w_buff1~0=~y$w_buff1~0_In770776972, ~y~0=~y~0_In770776972, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out770776972|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In770776972, ~y$w_buff1_used~0=~y$w_buff1_used~0_In770776972} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:04:20,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L862-4-->L863: Formula: (= v_~y~0_16 |v_ULTIMATE.start_main_#t~ite42_7|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_6|, ~y~0=v_~y~0_16, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:04:20,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L863-->L863-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-318671800 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-318671800 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-318671800|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-318671800| ~y$w_buff0_used~0_In-318671800)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-318671800, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-318671800} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-318671800, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-318671800, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-318671800|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:04:20,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L864-->L864-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-134825373 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-134825373 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-134825373 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-134825373 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-134825373|)) (and (= ~y$w_buff1_used~0_In-134825373 |ULTIMATE.start_main_#t~ite45_Out-134825373|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-134825373, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-134825373, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-134825373, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-134825373} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-134825373, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-134825373, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-134825373, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-134825373|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-134825373} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 21:04:20,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L865-->L865-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-163165011 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-163165011 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-163165011| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-163165011| ~y$r_buff0_thd0~0_In-163165011)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-163165011, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-163165011} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-163165011, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-163165011, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-163165011|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 21:04:20,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L866-->L866-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-33560930 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-33560930 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-33560930 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-33560930 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite47_Out-33560930|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-33560930 |ULTIMATE.start_main_#t~ite47_Out-33560930|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-33560930, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-33560930, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-33560930, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-33560930} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-33560930, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-33560930, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-33560930|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-33560930, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-33560930} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 21:04:20,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L866-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p3_EAX~0_8) (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= 0 v_~__unbuffered_p3_EBX~0_8) (= |v_ULTIMATE.start_main_#t~ite47_12| v_~y$r_buff1_thd0~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_8 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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 21:04:20,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:04:20 BasicIcfg [2019-12-27 21:04:20,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:04:20,881 INFO L168 Benchmark]: Toolchain (without parser) took 184445.27 ms. Allocated memory was 142.6 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 97.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 21:04:20,882 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 142.6 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 21:04:20,882 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.02 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 97.2 MB in the beginning and 152.5 MB in the end (delta: -55.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:04:20,883 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.94 ms. Allocated memory is still 199.8 MB. Free memory was 152.5 MB in the beginning and 149.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:04:20,883 INFO L168 Benchmark]: Boogie Preprocessor took 38.32 ms. Allocated memory is still 199.8 MB. Free memory was 149.7 MB in the beginning and 147.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:04:20,884 INFO L168 Benchmark]: RCFGBuilder took 863.43 ms. Allocated memory is still 199.8 MB. Free memory was 147.7 MB in the beginning and 98.1 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:04:20,884 INFO L168 Benchmark]: TraceAbstraction took 182693.24 ms. Allocated memory was 199.8 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 97.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 21:04:20,889 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.22 ms. Allocated memory is still 142.6 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 779.02 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 97.2 MB in the beginning and 152.5 MB in the end (delta: -55.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.94 ms. Allocated memory is still 199.8 MB. Free memory was 152.5 MB in the beginning and 149.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.32 ms. Allocated memory is still 199.8 MB. Free memory was 149.7 MB in the beginning and 147.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 863.43 ms. Allocated memory is still 199.8 MB. Free memory was 147.7 MB in the beginning and 98.1 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 182693.24 ms. Allocated memory was 199.8 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 97.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 183 ProgramPointsBefore, 90 ProgramPointsAfterwards, 211 TransitionsBefore, 97 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 6901 VarBasedMoverChecksPositive, 180 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 77566 CheckedPairsTotal, 124 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L850] FCALL, FORK 0 pthread_create(&t957, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L852] FCALL, FORK 0 pthread_create(&t958, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L854] FCALL, FORK 0 pthread_create(&t959, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 1 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L801] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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=0] [L856] FCALL, FORK 0 pthread_create(&t960, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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=0] [L815] 4 z = 1 [L818] 4 a = 1 [L821] 4 __unbuffered_p3_EAX = a [L824] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L827] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L801] 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) [L827] 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) [L828] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L757] 2 x = 1 [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, 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=1] [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L829] 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 [L764] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] 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 [L764] 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) [L765] 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)) [L766] 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)) [L767] EXPR 2 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, 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))=0, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 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)) [L768] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 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)) [L770] 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)) [L771] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L862] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L863] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L864] 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 [L865] 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, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 182.3s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 65.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6467 SDtfs, 13206 SDslu, 23443 SDs, 0 SdLazy, 23221 SolverSat, 1122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 782 GetRequests, 139 SyntacticMatches, 77 SemanticMatches, 566 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14170 ImplicationChecksByTransitivity, 17.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177426occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 61.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 533028 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1196 NumberOfCodeBlocks, 1196 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1110 ConstructedInterpolants, 0 QuantifiedInterpolants, 192707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...