/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:47:39,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:47:39,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:47:39,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:47:39,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:47:39,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:47:39,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:47:39,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:47:39,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:47:39,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:47:39,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:47:39,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:47:39,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:47:39,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:47:39,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:47:39,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:47:39,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:47:39,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:47:39,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:47:39,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:47:39,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:47:39,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:47:39,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:47:39,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:47:39,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:47:39,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:47:39,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:47:39,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:47:39,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:47:39,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:47:39,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:47:39,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:47:39,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:47:39,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:47:39,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:47:39,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:47:39,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:47:39,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:47:39,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:47:39,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:47:39,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:47:39,155 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:47:39,170 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:47:39,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:47:39,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:47:39,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:47:39,172 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:47:39,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:47:39,172 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:47:39,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:47:39,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:47:39,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:47:39,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:47:39,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:47:39,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:47:39,174 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:47:39,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:47:39,174 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:47:39,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:47:39,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:47:39,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:47:39,175 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:47:39,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:47:39,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:47:39,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:47:39,176 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:47:39,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:47:39,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:47:39,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:47:39,176 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:47:39,176 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:47:39,458 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:47:39,473 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:47:39,477 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:47:39,478 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:47:39,479 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:47:39,480 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_rmo.opt.i [2019-12-18 16:47:39,551 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a314c82a/b08ec9d4a2054bacb795b823cb44f1a4/FLAG19c6472d9 [2019-12-18 16:47:40,110 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:47:40,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_rmo.opt.i [2019-12-18 16:47:40,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a314c82a/b08ec9d4a2054bacb795b823cb44f1a4/FLAG19c6472d9 [2019-12-18 16:47:40,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a314c82a/b08ec9d4a2054bacb795b823cb44f1a4 [2019-12-18 16:47:40,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:47:40,376 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:47:40,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:47:40,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:47:40,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:47:40,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:47:40" (1/1) ... [2019-12-18 16:47:40,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@417d8fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:47:40, skipping insertion in model container [2019-12-18 16:47:40,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:47:40" (1/1) ... [2019-12-18 16:47:40,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:47:40,445 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:47:40,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:47:40,961 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:47:41,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:47:41,152 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:47:41,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:47:41 WrapperNode [2019-12-18 16:47:41,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:47:41,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:47:41,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:47:41,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:47:41,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:47:41" (1/1) ... [2019-12-18 16:47:41,182 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:47:41" (1/1) ... [2019-12-18 16:47:41,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:47:41,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:47:41,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:47:41,216 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:47:41,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:47:41" (1/1) ... [2019-12-18 16:47:41,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:47:41" (1/1) ... [2019-12-18 16:47:41,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:47:41" (1/1) ... [2019-12-18 16:47:41,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:47:41" (1/1) ... [2019-12-18 16:47:41,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:47:41" (1/1) ... [2019-12-18 16:47:41,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:47:41" (1/1) ... [2019-12-18 16:47:41,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:47:41" (1/1) ... [2019-12-18 16:47:41,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:47:41,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:47:41,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:47:41,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:47:41,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:47:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:47:41,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:47:41,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:47:41,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:47:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:47:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:47:41,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:47:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:47:41,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:47:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:47:41,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:47:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 16:47:41,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 16:47:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:47:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:47:41,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:47:41,323 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 16:47:42,090 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:47:42,091 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:47:42,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:47:42 BoogieIcfgContainer [2019-12-18 16:47:42,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:47:42,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:47:42,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:47:42,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:47:42,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:47:40" (1/3) ... [2019-12-18 16:47:42,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4467fec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:47:42, skipping insertion in model container [2019-12-18 16:47:42,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:47:41" (2/3) ... [2019-12-18 16:47:42,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4467fec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:47:42, skipping insertion in model container [2019-12-18 16:47:42,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:47:42" (3/3) ... [2019-12-18 16:47:42,102 INFO L109 eAbstractionObserver]: Analyzing ICFG mix023_rmo.opt.i [2019-12-18 16:47:42,112 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:47:42,112 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:47:42,121 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:47:42,122 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:47:42,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,169 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,169 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,172 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,172 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,216 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,216 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,217 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,217 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,217 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,224 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,224 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,224 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,224 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,224 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,225 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,225 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,225 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,225 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,225 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,226 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,226 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,226 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,226 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,226 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,226 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,227 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,227 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,227 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,227 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,227 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,228 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,228 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,228 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,228 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,228 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,229 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,229 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,229 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,229 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,233 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,233 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,233 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,234 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,234 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,234 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,234 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,235 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,235 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,235 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,238 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,238 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,243 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,246 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,250 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,250 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,251 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:47:42,267 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 16:47:42,288 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:47:42,288 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:47:42,288 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:47:42,288 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:47:42,288 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:47:42,289 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:47:42,289 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:47:42,289 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:47:42,307 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 16:47:42,309 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 16:47:42,401 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 16:47:42,401 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:47:42,420 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 16:47:42,450 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 16:47:42,498 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 16:47:42,498 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:47:42,507 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 16:47:42,529 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 16:47:42,530 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:47:47,546 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-12-18 16:47:48,316 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 16:47:48,488 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 16:47:48,665 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66461 [2019-12-18 16:47:48,666 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 16:47:48,671 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 95 transitions [2019-12-18 16:48:22,443 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160898 states. [2019-12-18 16:48:22,445 INFO L276 IsEmpty]: Start isEmpty. Operand 160898 states. [2019-12-18 16:48:22,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 16:48:22,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:48:22,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:48:22,453 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-18 16:48:22,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:48:22,459 INFO L82 PathProgramCache]: Analyzing trace with hash 406431864, now seen corresponding path program 1 times [2019-12-18 16:48:22,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:48:22,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996959412] [2019-12-18 16:48:22,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:48:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:48:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:48:22,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996959412] [2019-12-18 16:48:22,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:48:22,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:48:22,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074973627] [2019-12-18 16:48:22,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:48:22,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:48:22,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:48:22,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:48:22,741 INFO L87 Difference]: Start difference. First operand 160898 states. Second operand 3 states. [2019-12-18 16:48:28,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:48:28,034 INFO L93 Difference]: Finished difference Result 158998 states and 767616 transitions. [2019-12-18 16:48:28,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:48:28,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 16:48:28,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:48:29,105 INFO L225 Difference]: With dead ends: 158998 [2019-12-18 16:48:29,105 INFO L226 Difference]: Without dead ends: 149254 [2019-12-18 16:48:29,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:48:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149254 states. [2019-12-18 16:48:37,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149254 to 149254. [2019-12-18 16:48:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149254 states. [2019-12-18 16:48:44,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149254 states to 149254 states and 719596 transitions. [2019-12-18 16:48:44,215 INFO L78 Accepts]: Start accepts. Automaton has 149254 states and 719596 transitions. Word has length 7 [2019-12-18 16:48:44,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:48:44,216 INFO L462 AbstractCegarLoop]: Abstraction has 149254 states and 719596 transitions. [2019-12-18 16:48:44,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:48:44,216 INFO L276 IsEmpty]: Start isEmpty. Operand 149254 states and 719596 transitions. [2019-12-18 16:48:44,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 16:48:44,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:48:44,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:48:44,231 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-18 16:48:44,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:48:44,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1843730986, now seen corresponding path program 1 times [2019-12-18 16:48:44,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:48:44,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449428326] [2019-12-18 16:48:44,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:48:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:48:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:48:44,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449428326] [2019-12-18 16:48:44,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:48:44,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:48:44,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803348618] [2019-12-18 16:48:44,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:48:44,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:48:44,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:48:44,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:48:44,331 INFO L87 Difference]: Start difference. First operand 149254 states and 719596 transitions. Second operand 3 states. [2019-12-18 16:48:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:48:44,978 INFO L93 Difference]: Finished difference Result 94546 states and 411602 transitions. [2019-12-18 16:48:44,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:48:44,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 16:48:44,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:48:51,467 INFO L225 Difference]: With dead ends: 94546 [2019-12-18 16:48:51,467 INFO L226 Difference]: Without dead ends: 94546 [2019-12-18 16:48:51,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:48:54,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94546 states. [2019-12-18 16:48:55,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94546 to 94546. [2019-12-18 16:48:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94546 states. [2019-12-18 16:48:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94546 states to 94546 states and 411602 transitions. [2019-12-18 16:48:55,919 INFO L78 Accepts]: Start accepts. Automaton has 94546 states and 411602 transitions. Word has length 15 [2019-12-18 16:48:55,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:48:55,920 INFO L462 AbstractCegarLoop]: Abstraction has 94546 states and 411602 transitions. [2019-12-18 16:48:55,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:48:55,920 INFO L276 IsEmpty]: Start isEmpty. Operand 94546 states and 411602 transitions. [2019-12-18 16:48:55,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 16:48:55,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:48:55,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:48:55,923 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-18 16:48:55,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:48:55,923 INFO L82 PathProgramCache]: Analyzing trace with hash -425966823, now seen corresponding path program 1 times [2019-12-18 16:48:55,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:48:55,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966648492] [2019-12-18 16:48:55,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:48:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:48:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:48:56,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966648492] [2019-12-18 16:48:56,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:48:56,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:48:56,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136483072] [2019-12-18 16:48:56,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:48:56,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:48:56,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:48:56,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:48:56,012 INFO L87 Difference]: Start difference. First operand 94546 states and 411602 transitions. Second operand 4 states. [2019-12-18 16:48:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:48:57,949 INFO L93 Difference]: Finished difference Result 144639 states and 604914 transitions. [2019-12-18 16:48:57,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:48:57,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 16:48:57,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:48:58,568 INFO L225 Difference]: With dead ends: 144639 [2019-12-18 16:48:58,568 INFO L226 Difference]: Without dead ends: 144527 [2019-12-18 16:48:58,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-18 16:49:02,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144527 states. [2019-12-18 16:49:12,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144527 to 133390. [2019-12-18 16:49:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133390 states. [2019-12-18 16:49:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133390 states to 133390 states and 563187 transitions. [2019-12-18 16:49:12,973 INFO L78 Accepts]: Start accepts. Automaton has 133390 states and 563187 transitions. Word has length 15 [2019-12-18 16:49:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:12,973 INFO L462 AbstractCegarLoop]: Abstraction has 133390 states and 563187 transitions. [2019-12-18 16:49:12,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:49:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand 133390 states and 563187 transitions. [2019-12-18 16:49:12,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:49:12,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:12,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:49:12,977 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-18 16:49:12,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:12,978 INFO L82 PathProgramCache]: Analyzing trace with hash -35287386, now seen corresponding path program 1 times [2019-12-18 16:49:12,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:12,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943854494] [2019-12-18 16:49:12,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:13,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943854494] [2019-12-18 16:49:13,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:13,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:49:13,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617586020] [2019-12-18 16:49:13,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:49:13,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:13,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:49:13,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:49:13,044 INFO L87 Difference]: Start difference. First operand 133390 states and 563187 transitions. Second operand 4 states. [2019-12-18 16:49:13,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:13,218 INFO L93 Difference]: Finished difference Result 37161 states and 133398 transitions. [2019-12-18 16:49:13,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:49:13,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:49:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:13,293 INFO L225 Difference]: With dead ends: 37161 [2019-12-18 16:49:13,293 INFO L226 Difference]: Without dead ends: 37161 [2019-12-18 16:49:13,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:49:13,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37161 states. [2019-12-18 16:49:14,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37161 to 37161. [2019-12-18 16:49:14,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37161 states. [2019-12-18 16:49:14,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37161 states to 37161 states and 133398 transitions. [2019-12-18 16:49:14,643 INFO L78 Accepts]: Start accepts. Automaton has 37161 states and 133398 transitions. Word has length 16 [2019-12-18 16:49:14,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:14,643 INFO L462 AbstractCegarLoop]: Abstraction has 37161 states and 133398 transitions. [2019-12-18 16:49:14,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:49:14,643 INFO L276 IsEmpty]: Start isEmpty. Operand 37161 states and 133398 transitions. [2019-12-18 16:49:14,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:49:14,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:14,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:49:14,648 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-18 16:49:14,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:14,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1700714978, now seen corresponding path program 1 times [2019-12-18 16:49:14,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:14,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783222352] [2019-12-18 16:49:14,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:14,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:14,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783222352] [2019-12-18 16:49:14,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:14,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:49:14,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565071761] [2019-12-18 16:49:14,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:49:14,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:14,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:49:14,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:49:14,730 INFO L87 Difference]: Start difference. First operand 37161 states and 133398 transitions. Second operand 5 states. [2019-12-18 16:49:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:15,237 INFO L93 Difference]: Finished difference Result 54896 states and 192989 transitions. [2019-12-18 16:49:15,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:49:15,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 16:49:15,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:15,369 INFO L225 Difference]: With dead ends: 54896 [2019-12-18 16:49:15,369 INFO L226 Difference]: Without dead ends: 54878 [2019-12-18 16:49:15,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:49:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54878 states. [2019-12-18 16:49:16,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54878 to 43369. [2019-12-18 16:49:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43369 states. [2019-12-18 16:49:19,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43369 states to 43369 states and 154803 transitions. [2019-12-18 16:49:19,432 INFO L78 Accepts]: Start accepts. Automaton has 43369 states and 154803 transitions. Word has length 16 [2019-12-18 16:49:19,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:19,432 INFO L462 AbstractCegarLoop]: Abstraction has 43369 states and 154803 transitions. [2019-12-18 16:49:19,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:49:19,432 INFO L276 IsEmpty]: Start isEmpty. Operand 43369 states and 154803 transitions. [2019-12-18 16:49:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 16:49:19,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:19,451 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-18 16:49:19,451 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-18 16:49:19,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:19,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1135187325, now seen corresponding path program 1 times [2019-12-18 16:49:19,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:19,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675829608] [2019-12-18 16:49:19,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:19,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:19,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675829608] [2019-12-18 16:49:19,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:19,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:49:19,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943428173] [2019-12-18 16:49:19,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:49:19,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:19,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:49:19,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:49:19,548 INFO L87 Difference]: Start difference. First operand 43369 states and 154803 transitions. Second operand 6 states. [2019-12-18 16:49:20,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:20,596 INFO L93 Difference]: Finished difference Result 65283 states and 226759 transitions. [2019-12-18 16:49:20,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:49:20,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 16:49:20,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:20,734 INFO L225 Difference]: With dead ends: 65283 [2019-12-18 16:49:20,734 INFO L226 Difference]: Without dead ends: 65253 [2019-12-18 16:49:20,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:49:20,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65253 states. [2019-12-18 16:49:21,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65253 to 43597. [2019-12-18 16:49:21,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43597 states. [2019-12-18 16:49:22,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43597 states to 43597 states and 154758 transitions. [2019-12-18 16:49:22,210 INFO L78 Accepts]: Start accepts. Automaton has 43597 states and 154758 transitions. Word has length 24 [2019-12-18 16:49:22,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:22,211 INFO L462 AbstractCegarLoop]: Abstraction has 43597 states and 154758 transitions. [2019-12-18 16:49:22,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:49:22,211 INFO L276 IsEmpty]: Start isEmpty. Operand 43597 states and 154758 transitions. [2019-12-18 16:49:22,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 16:49:22,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:22,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:49:22,234 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-18 16:49:22,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:22,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1458605799, now seen corresponding path program 1 times [2019-12-18 16:49:22,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:22,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10401153] [2019-12-18 16:49:22,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:22,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:22,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10401153] [2019-12-18 16:49:22,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:22,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:49:22,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008162093] [2019-12-18 16:49:22,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:49:22,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:22,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:49:22,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:49:22,317 INFO L87 Difference]: Start difference. First operand 43597 states and 154758 transitions. Second operand 5 states. [2019-12-18 16:49:22,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:22,439 INFO L93 Difference]: Finished difference Result 23301 states and 83755 transitions. [2019-12-18 16:49:22,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:49:22,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 16:49:22,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:22,485 INFO L225 Difference]: With dead ends: 23301 [2019-12-18 16:49:22,485 INFO L226 Difference]: Without dead ends: 23301 [2019-12-18 16:49:22,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:49:22,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23301 states. [2019-12-18 16:49:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23301 to 22997. [2019-12-18 16:49:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22997 states. [2019-12-18 16:49:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22997 states to 22997 states and 82723 transitions. [2019-12-18 16:49:22,905 INFO L78 Accepts]: Start accepts. Automaton has 22997 states and 82723 transitions. Word has length 28 [2019-12-18 16:49:22,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:22,905 INFO L462 AbstractCegarLoop]: Abstraction has 22997 states and 82723 transitions. [2019-12-18 16:49:22,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:49:22,906 INFO L276 IsEmpty]: Start isEmpty. Operand 22997 states and 82723 transitions. [2019-12-18 16:49:22,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 16:49:22,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:22,948 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-18 16:49:22,948 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-18 16:49:22,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:22,949 INFO L82 PathProgramCache]: Analyzing trace with hash 289915716, now seen corresponding path program 1 times [2019-12-18 16:49:22,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:22,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255732913] [2019-12-18 16:49:22,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:23,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255732913] [2019-12-18 16:49:23,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:23,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:49:23,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347917364] [2019-12-18 16:49:23,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:49:23,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:23,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:49:23,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:49:23,046 INFO L87 Difference]: Start difference. First operand 22997 states and 82723 transitions. Second operand 3 states. [2019-12-18 16:49:23,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:23,181 INFO L93 Difference]: Finished difference Result 34696 states and 119073 transitions. [2019-12-18 16:49:23,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:49:23,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-18 16:49:23,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:23,224 INFO L225 Difference]: With dead ends: 34696 [2019-12-18 16:49:23,224 INFO L226 Difference]: Without dead ends: 23444 [2019-12-18 16:49:23,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:49:23,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23444 states. [2019-12-18 16:49:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23444 to 23042. [2019-12-18 16:49:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23042 states. [2019-12-18 16:49:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23042 states to 23042 states and 72359 transitions. [2019-12-18 16:49:23,629 INFO L78 Accepts]: Start accepts. Automaton has 23042 states and 72359 transitions. Word has length 42 [2019-12-18 16:49:23,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:23,630 INFO L462 AbstractCegarLoop]: Abstraction has 23042 states and 72359 transitions. [2019-12-18 16:49:23,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:49:23,630 INFO L276 IsEmpty]: Start isEmpty. Operand 23042 states and 72359 transitions. [2019-12-18 16:49:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 16:49:23,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:23,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:49:23,670 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-18 16:49:23,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:23,670 INFO L82 PathProgramCache]: Analyzing trace with hash 9371836, now seen corresponding path program 1 times [2019-12-18 16:49:23,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:23,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16599613] [2019-12-18 16:49:23,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:23,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-18 16:49:23,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16599613] [2019-12-18 16:49:23,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:23,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:49:23,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293212102] [2019-12-18 16:49:23,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:49:23,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:23,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:49:23,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:49:23,758 INFO L87 Difference]: Start difference. First operand 23042 states and 72359 transitions. Second operand 6 states. [2019-12-18 16:49:23,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:23,910 INFO L93 Difference]: Finished difference Result 21758 states and 69087 transitions. [2019-12-18 16:49:23,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:49:23,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-18 16:49:23,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:23,934 INFO L225 Difference]: With dead ends: 21758 [2019-12-18 16:49:23,934 INFO L226 Difference]: Without dead ends: 11194 [2019-12-18 16:49:23,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:49:24,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11194 states. [2019-12-18 16:49:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11194 to 10798. [2019-12-18 16:49:24,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10798 states. [2019-12-18 16:49:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10798 states to 10798 states and 34133 transitions. [2019-12-18 16:49:24,374 INFO L78 Accepts]: Start accepts. Automaton has 10798 states and 34133 transitions. Word has length 43 [2019-12-18 16:49:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:24,375 INFO L462 AbstractCegarLoop]: Abstraction has 10798 states and 34133 transitions. [2019-12-18 16:49:24,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:49:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 10798 states and 34133 transitions. [2019-12-18 16:49:24,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:49:24,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:24,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-18 16:49:24,393 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-18 16:49:24,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:24,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1454862528, now seen corresponding path program 1 times [2019-12-18 16:49:24,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:24,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994043458] [2019-12-18 16:49:24,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:24,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994043458] [2019-12-18 16:49:24,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:24,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:49:24,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105607905] [2019-12-18 16:49:24,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:49:24,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:24,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:49:24,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:49:24,455 INFO L87 Difference]: Start difference. First operand 10798 states and 34133 transitions. Second operand 3 states. [2019-12-18 16:49:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:24,537 INFO L93 Difference]: Finished difference Result 14554 states and 45133 transitions. [2019-12-18 16:49:24,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:49:24,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 16:49:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:24,558 INFO L225 Difference]: With dead ends: 14554 [2019-12-18 16:49:24,559 INFO L226 Difference]: Without dead ends: 14554 [2019-12-18 16:49:24,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:49:24,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14554 states. [2019-12-18 16:49:24,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14554 to 11851. [2019-12-18 16:49:24,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11851 states. [2019-12-18 16:49:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11851 states to 11851 states and 37349 transitions. [2019-12-18 16:49:24,757 INFO L78 Accepts]: Start accepts. Automaton has 11851 states and 37349 transitions. Word has length 57 [2019-12-18 16:49:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:24,757 INFO L462 AbstractCegarLoop]: Abstraction has 11851 states and 37349 transitions. [2019-12-18 16:49:24,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:49:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 11851 states and 37349 transitions. [2019-12-18 16:49:24,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:49:24,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:24,770 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-18 16:49:24,770 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-18 16:49:24,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:24,771 INFO L82 PathProgramCache]: Analyzing trace with hash -880753033, now seen corresponding path program 1 times [2019-12-18 16:49:24,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:24,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297573846] [2019-12-18 16:49:24,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:24,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297573846] [2019-12-18 16:49:24,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:24,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:49:24,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985507243] [2019-12-18 16:49:24,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:49:24,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:24,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:49:24,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:49:24,875 INFO L87 Difference]: Start difference. First operand 11851 states and 37349 transitions. Second operand 4 states. [2019-12-18 16:49:24,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:24,996 INFO L93 Difference]: Finished difference Result 21477 states and 67702 transitions. [2019-12-18 16:49:24,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:49:24,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-18 16:49:24,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:25,022 INFO L225 Difference]: With dead ends: 21477 [2019-12-18 16:49:25,022 INFO L226 Difference]: Without dead ends: 9937 [2019-12-18 16:49:25,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:49:25,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9937 states. [2019-12-18 16:49:25,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9937 to 9937. [2019-12-18 16:49:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9937 states. [2019-12-18 16:49:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9937 states to 9937 states and 31212 transitions. [2019-12-18 16:49:25,317 INFO L78 Accepts]: Start accepts. Automaton has 9937 states and 31212 transitions. Word has length 57 [2019-12-18 16:49:25,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:25,317 INFO L462 AbstractCegarLoop]: Abstraction has 9937 states and 31212 transitions. [2019-12-18 16:49:25,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:49:25,318 INFO L276 IsEmpty]: Start isEmpty. Operand 9937 states and 31212 transitions. [2019-12-18 16:49:25,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:49:25,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:25,336 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-18 16:49:25,337 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-18 16:49:25,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:25,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1310347391, now seen corresponding path program 2 times [2019-12-18 16:49:25,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:25,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435461099] [2019-12-18 16:49:25,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:25,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:25,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435461099] [2019-12-18 16:49:25,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:25,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:49:25,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786682929] [2019-12-18 16:49:25,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:49:25,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:25,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:49:25,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:49:25,444 INFO L87 Difference]: Start difference. First operand 9937 states and 31212 transitions. Second operand 7 states. [2019-12-18 16:49:25,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:25,837 INFO L93 Difference]: Finished difference Result 26843 states and 84141 transitions. [2019-12-18 16:49:25,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:49:25,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 16:49:25,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:25,869 INFO L225 Difference]: With dead ends: 26843 [2019-12-18 16:49:25,869 INFO L226 Difference]: Without dead ends: 20587 [2019-12-18 16:49:25,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:49:25,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20587 states. [2019-12-18 16:49:26,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20587 to 12177. [2019-12-18 16:49:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12177 states. [2019-12-18 16:49:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 38516 transitions. [2019-12-18 16:49:26,132 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 38516 transitions. Word has length 57 [2019-12-18 16:49:26,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:26,132 INFO L462 AbstractCegarLoop]: Abstraction has 12177 states and 38516 transitions. [2019-12-18 16:49:26,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:49:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 38516 transitions. [2019-12-18 16:49:26,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:49:26,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:26,152 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-18 16:49:26,152 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-18 16:49:26,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:26,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1030628791, now seen corresponding path program 3 times [2019-12-18 16:49:26,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:26,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027378718] [2019-12-18 16:49:26,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:26,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:26,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027378718] [2019-12-18 16:49:26,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:26,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:49:26,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755483191] [2019-12-18 16:49:26,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:49:26,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:26,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:49:26,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:49:26,250 INFO L87 Difference]: Start difference. First operand 12177 states and 38516 transitions. Second operand 7 states. [2019-12-18 16:49:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:26,711 INFO L93 Difference]: Finished difference Result 33666 states and 104259 transitions. [2019-12-18 16:49:26,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:49:26,712 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 16:49:26,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:26,748 INFO L225 Difference]: With dead ends: 33666 [2019-12-18 16:49:26,748 INFO L226 Difference]: Without dead ends: 24086 [2019-12-18 16:49:26,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:49:26,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24086 states. [2019-12-18 16:49:27,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24086 to 15349. [2019-12-18 16:49:27,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15349 states. [2019-12-18 16:49:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15349 states to 15349 states and 48528 transitions. [2019-12-18 16:49:27,080 INFO L78 Accepts]: Start accepts. Automaton has 15349 states and 48528 transitions. Word has length 57 [2019-12-18 16:49:27,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:27,080 INFO L462 AbstractCegarLoop]: Abstraction has 15349 states and 48528 transitions. [2019-12-18 16:49:27,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:49:27,081 INFO L276 IsEmpty]: Start isEmpty. Operand 15349 states and 48528 transitions. [2019-12-18 16:49:27,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:49:27,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:27,283 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-18 16:49:27,283 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-18 16:49:27,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:27,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1587000503, now seen corresponding path program 4 times [2019-12-18 16:49:27,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:27,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289113787] [2019-12-18 16:49:27,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:27,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:27,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289113787] [2019-12-18 16:49:27,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:27,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:49:27,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685399259] [2019-12-18 16:49:27,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:49:27,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:27,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:49:27,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:49:27,424 INFO L87 Difference]: Start difference. First operand 15349 states and 48528 transitions. Second operand 8 states. [2019-12-18 16:49:28,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:28,419 INFO L93 Difference]: Finished difference Result 34932 states and 106981 transitions. [2019-12-18 16:49:28,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 16:49:28,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-18 16:49:28,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:28,467 INFO L225 Difference]: With dead ends: 34932 [2019-12-18 16:49:28,467 INFO L226 Difference]: Without dead ends: 32668 [2019-12-18 16:49:28,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-18 16:49:28,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32668 states. [2019-12-18 16:49:28,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32668 to 15407. [2019-12-18 16:49:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15407 states. [2019-12-18 16:49:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15407 states to 15407 states and 48800 transitions. [2019-12-18 16:49:28,865 INFO L78 Accepts]: Start accepts. Automaton has 15407 states and 48800 transitions. Word has length 57 [2019-12-18 16:49:28,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:28,866 INFO L462 AbstractCegarLoop]: Abstraction has 15407 states and 48800 transitions. [2019-12-18 16:49:28,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:49:28,866 INFO L276 IsEmpty]: Start isEmpty. Operand 15407 states and 48800 transitions. [2019-12-18 16:49:28,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:49:28,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:28,884 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-18 16:49:28,884 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-18 16:49:28,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:28,884 INFO L82 PathProgramCache]: Analyzing trace with hash -979581959, now seen corresponding path program 5 times [2019-12-18 16:49:28,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:28,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920228914] [2019-12-18 16:49:28,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:29,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:29,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920228914] [2019-12-18 16:49:29,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:29,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:49:29,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232084669] [2019-12-18 16:49:29,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:49:29,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:29,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:49:29,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:49:29,005 INFO L87 Difference]: Start difference. First operand 15407 states and 48800 transitions. Second operand 9 states. [2019-12-18 16:49:30,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:30,466 INFO L93 Difference]: Finished difference Result 48430 states and 148036 transitions. [2019-12-18 16:49:30,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 16:49:30,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 16:49:30,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:30,536 INFO L225 Difference]: With dead ends: 48430 [2019-12-18 16:49:30,536 INFO L226 Difference]: Without dead ends: 46166 [2019-12-18 16:49:30,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-12-18 16:49:30,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46166 states. [2019-12-18 16:49:31,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46166 to 15428. [2019-12-18 16:49:31,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15428 states. [2019-12-18 16:49:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15428 states to 15428 states and 48880 transitions. [2019-12-18 16:49:31,044 INFO L78 Accepts]: Start accepts. Automaton has 15428 states and 48880 transitions. Word has length 57 [2019-12-18 16:49:31,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:31,044 INFO L462 AbstractCegarLoop]: Abstraction has 15428 states and 48880 transitions. [2019-12-18 16:49:31,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:49:31,044 INFO L276 IsEmpty]: Start isEmpty. Operand 15428 states and 48880 transitions. [2019-12-18 16:49:31,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:49:31,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:31,062 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-18 16:49:31,062 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-18 16:49:31,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:31,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2032569873, now seen corresponding path program 6 times [2019-12-18 16:49:31,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:31,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694175351] [2019-12-18 16:49:31,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:31,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694175351] [2019-12-18 16:49:31,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:31,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:49:31,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898918244] [2019-12-18 16:49:31,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:49:31,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:31,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:49:31,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:49:31,372 INFO L87 Difference]: Start difference. First operand 15428 states and 48880 transitions. Second operand 9 states. [2019-12-18 16:49:33,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:33,073 INFO L93 Difference]: Finished difference Result 62597 states and 191406 transitions. [2019-12-18 16:49:33,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 16:49:33,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 16:49:33,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:33,159 INFO L225 Difference]: With dead ends: 62597 [2019-12-18 16:49:33,159 INFO L226 Difference]: Without dead ends: 54167 [2019-12-18 16:49:33,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 16:49:33,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54167 states. [2019-12-18 16:49:33,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54167 to 19382. [2019-12-18 16:49:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19382 states. [2019-12-18 16:49:33,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19382 states to 19382 states and 61433 transitions. [2019-12-18 16:49:33,798 INFO L78 Accepts]: Start accepts. Automaton has 19382 states and 61433 transitions. Word has length 57 [2019-12-18 16:49:33,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:33,799 INFO L462 AbstractCegarLoop]: Abstraction has 19382 states and 61433 transitions. [2019-12-18 16:49:33,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:49:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 19382 states and 61433 transitions. [2019-12-18 16:49:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:49:33,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:33,820 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:49:33,820 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-18 16:49:33,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:33,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1355321517, now seen corresponding path program 7 times [2019-12-18 16:49:33,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:33,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716867080] [2019-12-18 16:49:33,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:33,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716867080] [2019-12-18 16:49:33,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:33,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:49:33,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309828461] [2019-12-18 16:49:33,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:49:33,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:33,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:49:33,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:49:33,925 INFO L87 Difference]: Start difference. First operand 19382 states and 61433 transitions. Second operand 3 states. [2019-12-18 16:49:34,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:34,010 INFO L93 Difference]: Finished difference Result 16496 states and 51087 transitions. [2019-12-18 16:49:34,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:49:34,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 16:49:34,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:34,045 INFO L225 Difference]: With dead ends: 16496 [2019-12-18 16:49:34,045 INFO L226 Difference]: Without dead ends: 16496 [2019-12-18 16:49:34,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:49:34,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16496 states. [2019-12-18 16:49:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16496 to 15921. [2019-12-18 16:49:34,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15921 states. [2019-12-18 16:49:34,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15921 states to 15921 states and 49194 transitions. [2019-12-18 16:49:34,366 INFO L78 Accepts]: Start accepts. Automaton has 15921 states and 49194 transitions. Word has length 57 [2019-12-18 16:49:34,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:34,367 INFO L462 AbstractCegarLoop]: Abstraction has 15921 states and 49194 transitions. [2019-12-18 16:49:34,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:49:34,367 INFO L276 IsEmpty]: Start isEmpty. Operand 15921 states and 49194 transitions. [2019-12-18 16:49:34,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:49:34,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:34,383 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-18 16:49:34,383 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-18 16:49:34,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:34,384 INFO L82 PathProgramCache]: Analyzing trace with hash -454137528, now seen corresponding path program 1 times [2019-12-18 16:49:34,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:34,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714339361] [2019-12-18 16:49:34,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:34,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714339361] [2019-12-18 16:49:34,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:34,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 16:49:34,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742828087] [2019-12-18 16:49:34,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 16:49:34,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:34,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 16:49:34,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:49:34,938 INFO L87 Difference]: Start difference. First operand 15921 states and 49194 transitions. Second operand 14 states. [2019-12-18 16:49:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:40,077 INFO L93 Difference]: Finished difference Result 34759 states and 106678 transitions. [2019-12-18 16:49:40,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 16:49:40,077 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-12-18 16:49:40,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:40,113 INFO L225 Difference]: With dead ends: 34759 [2019-12-18 16:49:40,114 INFO L226 Difference]: Without dead ends: 24895 [2019-12-18 16:49:40,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=412, Invalid=2038, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 16:49:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24895 states. [2019-12-18 16:49:40,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24895 to 16863. [2019-12-18 16:49:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16863 states. [2019-12-18 16:49:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16863 states to 16863 states and 51599 transitions. [2019-12-18 16:49:40,424 INFO L78 Accepts]: Start accepts. Automaton has 16863 states and 51599 transitions. Word has length 58 [2019-12-18 16:49:40,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:40,425 INFO L462 AbstractCegarLoop]: Abstraction has 16863 states and 51599 transitions. [2019-12-18 16:49:40,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 16:49:40,425 INFO L276 IsEmpty]: Start isEmpty. Operand 16863 states and 51599 transitions. [2019-12-18 16:49:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:49:40,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:40,442 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-18 16:49:40,442 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-18 16:49:40,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:40,442 INFO L82 PathProgramCache]: Analyzing trace with hash 532534436, now seen corresponding path program 2 times [2019-12-18 16:49:40,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:40,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916160095] [2019-12-18 16:49:40,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:40,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916160095] [2019-12-18 16:49:40,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:40,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:49:40,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646099717] [2019-12-18 16:49:40,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:49:40,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:40,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:49:40,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:49:40,554 INFO L87 Difference]: Start difference. First operand 16863 states and 51599 transitions. Second operand 8 states. [2019-12-18 16:49:42,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:42,180 INFO L93 Difference]: Finished difference Result 29506 states and 87225 transitions. [2019-12-18 16:49:42,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 16:49:42,181 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-18 16:49:42,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:42,223 INFO L225 Difference]: With dead ends: 29506 [2019-12-18 16:49:42,223 INFO L226 Difference]: Without dead ends: 29284 [2019-12-18 16:49:42,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-18 16:49:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29284 states. [2019-12-18 16:49:42,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29284 to 20939. [2019-12-18 16:49:42,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20939 states. [2019-12-18 16:49:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20939 states to 20939 states and 63526 transitions. [2019-12-18 16:49:42,798 INFO L78 Accepts]: Start accepts. Automaton has 20939 states and 63526 transitions. Word has length 58 [2019-12-18 16:49:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:42,798 INFO L462 AbstractCegarLoop]: Abstraction has 20939 states and 63526 transitions. [2019-12-18 16:49:42,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:49:42,799 INFO L276 IsEmpty]: Start isEmpty. Operand 20939 states and 63526 transitions. [2019-12-18 16:49:42,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:49:42,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:42,820 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:49:42,820 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-18 16:49:42,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:42,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1780291492, now seen corresponding path program 3 times [2019-12-18 16:49:42,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:42,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993524381] [2019-12-18 16:49:42,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:43,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:43,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993524381] [2019-12-18 16:49:43,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:43,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:49:43,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784478588] [2019-12-18 16:49:43,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:49:43,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:43,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:49:43,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:49:43,020 INFO L87 Difference]: Start difference. First operand 20939 states and 63526 transitions. Second operand 11 states. [2019-12-18 16:49:44,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:44,854 INFO L93 Difference]: Finished difference Result 29537 states and 89081 transitions. [2019-12-18 16:49:44,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 16:49:44,855 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-18 16:49:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:44,896 INFO L225 Difference]: With dead ends: 29537 [2019-12-18 16:49:44,896 INFO L226 Difference]: Without dead ends: 28033 [2019-12-18 16:49:44,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-18 16:49:44,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28033 states. [2019-12-18 16:49:45,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28033 to 21051. [2019-12-18 16:49:45,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21051 states. [2019-12-18 16:49:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21051 states to 21051 states and 63768 transitions. [2019-12-18 16:49:45,282 INFO L78 Accepts]: Start accepts. Automaton has 21051 states and 63768 transitions. Word has length 58 [2019-12-18 16:49:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:45,283 INFO L462 AbstractCegarLoop]: Abstraction has 21051 states and 63768 transitions. [2019-12-18 16:49:45,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:49:45,283 INFO L276 IsEmpty]: Start isEmpty. Operand 21051 states and 63768 transitions. [2019-12-18 16:49:45,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:49:45,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:45,304 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-18 16:49:45,304 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-18 16:49:45,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:45,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1512869174, now seen corresponding path program 4 times [2019-12-18 16:49:45,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:45,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614747207] [2019-12-18 16:49:45,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:45,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:45,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614747207] [2019-12-18 16:49:45,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:45,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 16:49:45,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896204914] [2019-12-18 16:49:45,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 16:49:45,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:45,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 16:49:45,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:49:45,767 INFO L87 Difference]: Start difference. First operand 21051 states and 63768 transitions. Second operand 15 states. [2019-12-18 16:49:50,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:50,116 INFO L93 Difference]: Finished difference Result 36727 states and 108972 transitions. [2019-12-18 16:49:50,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-18 16:49:50,117 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2019-12-18 16:49:50,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:50,164 INFO L225 Difference]: With dead ends: 36727 [2019-12-18 16:49:50,165 INFO L226 Difference]: Without dead ends: 33403 [2019-12-18 16:49:50,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=294, Invalid=1598, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 16:49:50,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33403 states. [2019-12-18 16:49:50,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33403 to 21471. [2019-12-18 16:49:50,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21471 states. [2019-12-18 16:49:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21471 states to 21471 states and 64841 transitions. [2019-12-18 16:49:50,596 INFO L78 Accepts]: Start accepts. Automaton has 21471 states and 64841 transitions. Word has length 58 [2019-12-18 16:49:50,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:50,596 INFO L462 AbstractCegarLoop]: Abstraction has 21471 states and 64841 transitions. [2019-12-18 16:49:50,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 16:49:50,596 INFO L276 IsEmpty]: Start isEmpty. Operand 21471 states and 64841 transitions. [2019-12-18 16:49:50,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:49:50,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:50,620 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-18 16:49:50,621 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-18 16:49:50,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:50,621 INFO L82 PathProgramCache]: Analyzing trace with hash 797101106, now seen corresponding path program 5 times [2019-12-18 16:49:50,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:50,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523697575] [2019-12-18 16:49:50,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:50,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523697575] [2019-12-18 16:49:50,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:50,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:49:50,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053553364] [2019-12-18 16:49:50,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:49:50,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:50,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:49:50,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:49:50,768 INFO L87 Difference]: Start difference. First operand 21471 states and 64841 transitions. Second operand 11 states. [2019-12-18 16:49:52,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:52,382 INFO L93 Difference]: Finished difference Result 29261 states and 87990 transitions. [2019-12-18 16:49:52,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 16:49:52,383 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-18 16:49:52,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:52,427 INFO L225 Difference]: With dead ends: 29261 [2019-12-18 16:49:52,427 INFO L226 Difference]: Without dead ends: 28632 [2019-12-18 16:49:52,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-12-18 16:49:52,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28632 states. [2019-12-18 16:49:52,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28632 to 21403. [2019-12-18 16:49:52,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21403 states. [2019-12-18 16:49:52,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21403 states to 21403 states and 64679 transitions. [2019-12-18 16:49:52,831 INFO L78 Accepts]: Start accepts. Automaton has 21403 states and 64679 transitions. Word has length 58 [2019-12-18 16:49:52,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:52,831 INFO L462 AbstractCegarLoop]: Abstraction has 21403 states and 64679 transitions. [2019-12-18 16:49:52,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:49:52,831 INFO L276 IsEmpty]: Start isEmpty. Operand 21403 states and 64679 transitions. [2019-12-18 16:49:52,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:49:52,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:52,857 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-18 16:49:52,858 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-18 16:49:52,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:52,858 INFO L82 PathProgramCache]: Analyzing trace with hash -199714182, now seen corresponding path program 6 times [2019-12-18 16:49:52,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:52,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136602097] [2019-12-18 16:49:52,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:53,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:53,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136602097] [2019-12-18 16:49:53,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:53,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:49:53,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899212996] [2019-12-18 16:49:53,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:49:53,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:53,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:49:53,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:49:53,039 INFO L87 Difference]: Start difference. First operand 21403 states and 64679 transitions. Second operand 12 states. [2019-12-18 16:49:55,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:55,227 INFO L93 Difference]: Finished difference Result 34871 states and 104082 transitions. [2019-12-18 16:49:55,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 16:49:55,227 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-12-18 16:49:55,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:55,271 INFO L225 Difference]: With dead ends: 34871 [2019-12-18 16:49:55,272 INFO L226 Difference]: Without dead ends: 30231 [2019-12-18 16:49:55,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2019-12-18 16:49:55,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30231 states. [2019-12-18 16:49:55,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30231 to 20677. [2019-12-18 16:49:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20677 states. [2019-12-18 16:49:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20677 states to 20677 states and 62762 transitions. [2019-12-18 16:49:55,681 INFO L78 Accepts]: Start accepts. Automaton has 20677 states and 62762 transitions. Word has length 58 [2019-12-18 16:49:55,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:55,681 INFO L462 AbstractCegarLoop]: Abstraction has 20677 states and 62762 transitions. [2019-12-18 16:49:55,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:49:55,681 INFO L276 IsEmpty]: Start isEmpty. Operand 20677 states and 62762 transitions. [2019-12-18 16:49:55,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:49:55,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:55,707 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-18 16:49:55,707 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-18 16:49:55,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:55,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2078538356, now seen corresponding path program 7 times [2019-12-18 16:49:55,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:55,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035729288] [2019-12-18 16:49:55,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:55,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:55,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035729288] [2019-12-18 16:49:55,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:55,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:49:55,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99718566] [2019-12-18 16:49:55,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:49:55,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:55,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:49:55,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:49:55,780 INFO L87 Difference]: Start difference. First operand 20677 states and 62762 transitions. Second operand 3 states. [2019-12-18 16:49:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:55,872 INFO L93 Difference]: Finished difference Result 20677 states and 62760 transitions. [2019-12-18 16:49:55,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:49:55,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 16:49:55,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:55,904 INFO L225 Difference]: With dead ends: 20677 [2019-12-18 16:49:55,905 INFO L226 Difference]: Without dead ends: 20677 [2019-12-18 16:49:55,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:49:55,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20677 states. [2019-12-18 16:49:56,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20677 to 17662. [2019-12-18 16:49:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17662 states. [2019-12-18 16:49:56,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17662 states to 17662 states and 54496 transitions. [2019-12-18 16:49:56,217 INFO L78 Accepts]: Start accepts. Automaton has 17662 states and 54496 transitions. Word has length 58 [2019-12-18 16:49:56,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:56,217 INFO L462 AbstractCegarLoop]: Abstraction has 17662 states and 54496 transitions. [2019-12-18 16:49:56,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:49:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 17662 states and 54496 transitions. [2019-12-18 16:49:56,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:49:56,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:56,238 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-18 16:49:56,238 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-18 16:49:56,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:56,238 INFO L82 PathProgramCache]: Analyzing trace with hash 235346217, now seen corresponding path program 1 times [2019-12-18 16:49:56,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:56,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818888521] [2019-12-18 16:49:56,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:56,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:56,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818888521] [2019-12-18 16:49:56,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:56,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:49:56,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331713739] [2019-12-18 16:49:56,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:49:56,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:56,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:49:56,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:49:56,496 INFO L87 Difference]: Start difference. First operand 17662 states and 54496 transitions. Second operand 11 states. [2019-12-18 16:49:57,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:57,540 INFO L93 Difference]: Finished difference Result 31928 states and 98523 transitions. [2019-12-18 16:49:57,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 16:49:57,541 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-18 16:49:57,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:57,588 INFO L225 Difference]: With dead ends: 31928 [2019-12-18 16:49:57,588 INFO L226 Difference]: Without dead ends: 31362 [2019-12-18 16:49:57,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2019-12-18 16:49:57,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31362 states. [2019-12-18 16:49:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31362 to 20496. [2019-12-18 16:49:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20496 states. [2019-12-18 16:49:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20496 states to 20496 states and 63318 transitions. [2019-12-18 16:49:58,017 INFO L78 Accepts]: Start accepts. Automaton has 20496 states and 63318 transitions. Word has length 59 [2019-12-18 16:49:58,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:58,017 INFO L462 AbstractCegarLoop]: Abstraction has 20496 states and 63318 transitions. [2019-12-18 16:49:58,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:49:58,017 INFO L276 IsEmpty]: Start isEmpty. Operand 20496 states and 63318 transitions. [2019-12-18 16:49:58,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:49:58,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:58,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:49:58,042 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-18 16:49:58,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:58,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1674144661, now seen corresponding path program 2 times [2019-12-18 16:49:58,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:58,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229403623] [2019-12-18 16:49:58,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:49:58,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229403623] [2019-12-18 16:49:58,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:58,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:49:58,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814312054] [2019-12-18 16:49:58,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:49:58,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:58,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:49:58,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:49:58,516 INFO L87 Difference]: Start difference. First operand 20496 states and 63318 transitions. Second operand 11 states. [2019-12-18 16:49:59,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:59,646 INFO L93 Difference]: Finished difference Result 31968 states and 97963 transitions. [2019-12-18 16:49:59,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 16:49:59,647 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-18 16:49:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:59,688 INFO L225 Difference]: With dead ends: 31968 [2019-12-18 16:49:59,688 INFO L226 Difference]: Without dead ends: 26807 [2019-12-18 16:49:59,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-18 16:49:59,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26807 states. [2019-12-18 16:50:00,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26807 to 17228. [2019-12-18 16:50:00,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17228 states. [2019-12-18 16:50:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17228 states to 17228 states and 53135 transitions. [2019-12-18 16:50:00,040 INFO L78 Accepts]: Start accepts. Automaton has 17228 states and 53135 transitions. Word has length 59 [2019-12-18 16:50:00,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:00,040 INFO L462 AbstractCegarLoop]: Abstraction has 17228 states and 53135 transitions. [2019-12-18 16:50:00,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:50:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 17228 states and 53135 transitions. [2019-12-18 16:50:00,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:50:00,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:00,060 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-18 16:50:00,060 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-18 16:50:00,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:00,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1304528589, now seen corresponding path program 3 times [2019-12-18 16:50:00,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:00,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684450670] [2019-12-18 16:50:00,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:50:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:50:00,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684450670] [2019-12-18 16:50:00,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:50:00,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:50:00,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770747353] [2019-12-18 16:50:00,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:50:00,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:50:00,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:50:00,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:50:00,236 INFO L87 Difference]: Start difference. First operand 17228 states and 53135 transitions. Second operand 12 states. [2019-12-18 16:50:02,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:50:02,406 INFO L93 Difference]: Finished difference Result 24404 states and 74206 transitions. [2019-12-18 16:50:02,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 16:50:02,406 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-18 16:50:02,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:50:02,444 INFO L225 Difference]: With dead ends: 24404 [2019-12-18 16:50:02,444 INFO L226 Difference]: Without dead ends: 23326 [2019-12-18 16:50:02,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2019-12-18 16:50:02,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23326 states. [2019-12-18 16:50:02,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23326 to 16678. [2019-12-18 16:50:02,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16678 states. [2019-12-18 16:50:02,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16678 states to 16678 states and 51651 transitions. [2019-12-18 16:50:02,763 INFO L78 Accepts]: Start accepts. Automaton has 16678 states and 51651 transitions. Word has length 59 [2019-12-18 16:50:02,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:50:02,764 INFO L462 AbstractCegarLoop]: Abstraction has 16678 states and 51651 transitions. [2019-12-18 16:50:02,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:50:02,764 INFO L276 IsEmpty]: Start isEmpty. Operand 16678 states and 51651 transitions. [2019-12-18 16:50:02,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:50:02,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:50:02,786 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-18 16:50:02,786 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-18 16:50:02,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:50:02,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1779176519, now seen corresponding path program 4 times [2019-12-18 16:50:02,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:50:02,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039302919] [2019-12-18 16:50:02,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:50:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:50:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:50:02,893 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:50:02,893 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:50:02,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] ULTIMATE.startENTRY-->L846: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_48 0) (= v_~x~0_72 0) (= v_~y$w_buff1_used~0_529 0) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff1_thd1~0_122 0) (= 0 v_~y$w_buff0~0_386) (= 0 v_~y$r_buff0_thd2~0_330) (= (select .cse0 |v_ULTIMATE.start_main_~#t621~0.base_29|) 0) (= v_~__unbuffered_cnt~0_187 0) (= v_~main$tmp_guard1~0_42 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~y~0_163 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd3~0_189) (= 0 v_~__unbuffered_p3_EBX~0_48) (= v_~y$w_buff1~0_278 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t621~0.base_29| 4)) (= 0 v_~y$flush_delayed~0_49) (= 0 v_~y$read_delayed_var~0.base_5) (= v_~y$r_buff0_thd1~0_36 0) (= v_~y$w_buff0_used~0_832 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t621~0.base_29|) (= 0 v_~y$read_delayed_var~0.offset_5) (= 0 v_~y$r_buff1_thd4~0_202) (= v_~a~0_49 0) (= 0 v_~y$r_buff1_thd2~0_315) (= v_~y$r_buff0_thd0~0_117 0) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= 0 v_~y$r_buff0_thd3~0_225) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t621~0.base_29| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t621~0.base_29|) |v_ULTIMATE.start_main_~#t621~0.offset_21| 0)) |v_#memory_int_29|) (= 0 v_~__unbuffered_p1_EAX~0_47) (= (store .cse0 |v_ULTIMATE.start_main_~#t621~0.base_29| 1) |v_#valid_72|) (= 0 v_~__unbuffered_p3_EAX~0_48) (= |v_#NULL.offset_4| 0) (= 0 v_~y$r_buff0_thd4~0_120) (= 0 |v_ULTIMATE.start_main_~#t621~0.offset_21|) (= v_~weak$$choice2~0_186 0) (= v_~y$r_buff1_thd0~0_220 0) (= v_~z~0_163 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_82|, ULTIMATE.start_main_~#t622~0.offset=|v_ULTIMATE.start_main_~#t622~0.offset_21|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_~#t622~0.base=|v_ULTIMATE.start_main_~#t622~0.base_29|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_49, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_189, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_36, ~y$flush_delayed~0=v_~y$flush_delayed~0_49, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_48, #length=|v_#length_31|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_29|, ULTIMATE.start_main_~#t623~0.base=|v_ULTIMATE.start_main_~#t623~0.base_29|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_202, ~y$w_buff1~0=v_~y$w_buff1~0_278, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_330, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_187, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_220, ~x~0=v_~x~0_72, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_832, ULTIMATE.start_main_~#t621~0.base=|v_ULTIMATE.start_main_~#t621~0.base_29|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_122, ULTIMATE.start_main_~#t621~0.offset=|v_ULTIMATE.start_main_~#t621~0.offset_21|, ~y$w_buff0~0=v_~y$w_buff0~0_386, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_225, ULTIMATE.start_main_~#t624~0.base=|v_ULTIMATE.start_main_~#t624~0.base_17|, ~y~0=v_~y~0_163, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_48, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_315, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_120, ULTIMATE.start_main_~#t624~0.offset=|v_ULTIMATE.start_main_~#t624~0.offset_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_117, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ULTIMATE.start_main_~#t623~0.offset=|v_ULTIMATE.start_main_~#t623~0.offset_21|, ~z~0=v_~z~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_186, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_529} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t622~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t622~0.base, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t623~0.base, ~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_#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_~#t621~0.base, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t621~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t624~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t624~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t623~0.offset, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:50:02,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L846-1-->L848: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t622~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t622~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t622~0.base_12| 0)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t622~0.base_12| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t622~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t622~0.base_12|) |v_ULTIMATE.start_main_~#t622~0.offset_10| 1)) |v_#memory_int_17|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t622~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t622~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t622~0.offset=|v_ULTIMATE.start_main_~#t622~0.offset_10|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_19|, ULTIMATE.start_main_~#t622~0.base=|v_ULTIMATE.start_main_~#t622~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t622~0.offset, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t622~0.base] because there is no mapped edge [2019-12-18 16:50:02,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-1-->L850: Formula: (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t623~0.base_13| 4) |v_#length_23|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t623~0.base_13| 1)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t623~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t623~0.offset_11|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t623~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t623~0.base_13|) |v_ULTIMATE.start_main_~#t623~0.offset_11| 2)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t623~0.base_13|)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t623~0.base_13|))) 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_~#t623~0.base=|v_ULTIMATE.start_main_~#t623~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t623~0.offset=|v_ULTIMATE.start_main_~#t623~0.offset_11|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t623~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t623~0.offset, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 16:50:02,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L4-->L800: Formula: (and (= v_~y$r_buff0_thd4~0_25 v_~y$r_buff1_thd4~0_25) (= v_~y$r_buff0_thd3~0_17 1) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24 0)) (= v_~y$r_buff0_thd3~0_18 v_~y$r_buff1_thd3~0_11) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff1_thd2~0_32) (= v_~z~0_10 1) (= v_~y$r_buff0_thd0~0_19 v_~y$r_buff1_thd0~0_17)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_32, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_11, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_17, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24, ~z~0=v_~z~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 16:50:02,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L850-1-->L852: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t624~0.base_10| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t624~0.base_10| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t624~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t624~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t624~0.base_10| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t624~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t624~0.base_10|) |v_ULTIMATE.start_main_~#t624~0.offset_10| 3)) |v_#memory_int_15|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t624~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ULTIMATE.start_main_~#t624~0.offset=|v_ULTIMATE.start_main_~#t624~0.offset_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t624~0.base=|v_ULTIMATE.start_main_~#t624~0.base_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t624~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t624~0.base, #length] because there is no mapped edge [2019-12-18 16:50:02,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_23 1) (= v_~x~0_36 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_~__unbuffered_cnt~0_101 (+ v_~__unbuffered_cnt~0_102 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|} OutVars{~a~0=v_~a~0_23, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 16:50:02,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L823-2-->L823-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In83307324 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In83307324 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In83307324 |P3Thread1of1ForFork0_#t~ite32_Out83307324|)) (and (= ~y$w_buff1~0_In83307324 |P3Thread1of1ForFork0_#t~ite32_Out83307324|) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In83307324, ~y$w_buff1~0=~y$w_buff1~0_In83307324, ~y~0=~y~0_In83307324, ~y$w_buff1_used~0=~y$w_buff1_used~0_In83307324} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In83307324, ~y$w_buff1~0=~y$w_buff1~0_In83307324, ~y~0=~y~0_In83307324, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out83307324|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In83307324} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 16:50:02,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L823-4-->L824: Formula: (= v_~y~0_43 |v_P3Thread1of1ForFork0_#t~ite32_14|) InVars {P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_14|} OutVars{~y~0=v_~y~0_43, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_15|, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_13|} AuxVars[] AssignedVars[~y~0, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 16:50:02,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In546318595 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In546318595 256)))) (or (and (= 0 |P3Thread1of1ForFork0_#t~ite34_Out546318595|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In546318595 |P3Thread1of1ForFork0_#t~ite34_Out546318595|) (or .cse0 .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In546318595, ~y$w_buff0_used~0=~y$w_buff0_used~0_In546318595} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In546318595, ~y$w_buff0_used~0=~y$w_buff0_used~0_In546318595, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out546318595|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 16:50:02,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1095456644 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1095456644 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out-1095456644| ~y$w_buff0_used~0_In-1095456644)) (and (not .cse0) (= |P2Thread1of1ForFork3_#t~ite28_Out-1095456644| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1095456644, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1095456644} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1095456644, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1095456644, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-1095456644|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 16:50:02,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L802-->L802-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-1222817280 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1222817280 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-1222817280 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1222817280 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-1222817280|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork3_#t~ite29_Out-1222817280| ~y$w_buff1_used~0_In-1222817280)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1222817280, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1222817280, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1222817280, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1222817280} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1222817280, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1222817280, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1222817280, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-1222817280|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1222817280} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 16:50:02,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L803-->L804: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In642099836 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In642099836 256) 0))) (or (and (= ~y$r_buff0_thd3~0_In642099836 ~y$r_buff0_thd3~0_Out642099836) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd3~0_Out642099836 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In642099836, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In642099836} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out642099836|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In642099836, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out642099836} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 16:50:02,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L804-->L804-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In10688317 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In10688317 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In10688317 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In10688317 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In10688317 |P2Thread1of1ForFork3_#t~ite31_Out10688317|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork3_#t~ite31_Out10688317|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In10688317, ~y$w_buff0_used~0=~y$w_buff0_used~0_In10688317, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In10688317, ~y$w_buff1_used~0=~y$w_buff1_used~0_In10688317} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In10688317, ~y$w_buff0_used~0=~y$w_buff0_used~0_In10688317, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In10688317, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out10688317|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In10688317} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 16:50:02,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L804-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#t~ite31_40| v_~y$r_buff1_thd3~0_125) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_126 (+ v_~__unbuffered_cnt~0_127 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_125, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, 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-18 16:50:02,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L825-->L825-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In351802758 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd4~0_In351802758 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In351802758 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In351802758 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite35_Out351802758|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In351802758 |P3Thread1of1ForFork0_#t~ite35_Out351802758|) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In351802758, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In351802758, ~y$w_buff0_used~0=~y$w_buff0_used~0_In351802758, ~y$w_buff1_used~0=~y$w_buff1_used~0_In351802758} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In351802758, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In351802758, ~y$w_buff0_used~0=~y$w_buff0_used~0_In351802758, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out351802758|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In351802758} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 16:50:02,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-1409482869 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1409482869 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out-1409482869| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out-1409482869| ~y$r_buff0_thd4~0_In-1409482869)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1409482869, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1409482869} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1409482869, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1409482869, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-1409482869|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 16:50:02,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In422897995 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In422897995 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd4~0_In422897995 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In422897995 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite37_Out422897995| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P3Thread1of1ForFork0_#t~ite37_Out422897995| ~y$r_buff1_thd4~0_In422897995)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In422897995, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In422897995, ~y$w_buff0_used~0=~y$w_buff0_used~0_In422897995, ~y$w_buff1_used~0=~y$w_buff1_used~0_In422897995} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In422897995, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In422897995, ~y$w_buff0_used~0=~y$w_buff0_used~0_In422897995, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out422897995|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In422897995} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 16:50:02,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L827-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= |v_P3Thread1of1ForFork0_#t~ite37_48| v_~y$r_buff1_thd4~0_61) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_61, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_47|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95} 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-18 16:50:02,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1597608734 256) 0))) (or (and (not .cse0) (= ~y$w_buff0~0_In-1597608734 |P1Thread1of1ForFork2_#t~ite9_Out-1597608734|) (= |P1Thread1of1ForFork2_#t~ite8_In-1597608734| |P1Thread1of1ForFork2_#t~ite8_Out-1597608734|)) (and (= ~y$w_buff0~0_In-1597608734 |P1Thread1of1ForFork2_#t~ite8_Out-1597608734|) (= |P1Thread1of1ForFork2_#t~ite9_Out-1597608734| |P1Thread1of1ForFork2_#t~ite8_Out-1597608734|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1597608734 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1597608734 256)) (and (= (mod ~y$r_buff1_thd2~0_In-1597608734 256) 0) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1597608734 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1597608734, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1597608734, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-1597608734|, ~y$w_buff0~0=~y$w_buff0~0_In-1597608734, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1597608734, ~weak$$choice2~0=~weak$$choice2~0_In-1597608734, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1597608734} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1597608734, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1597608734|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1597608734, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1597608734|, ~y$w_buff0~0=~y$w_buff0~0_In-1597608734, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1597608734, ~weak$$choice2~0=~weak$$choice2~0_In-1597608734, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1597608734} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 16:50:02,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2127296603 256)))) (or (and (not .cse0) (= ~y$w_buff0_used~0_In-2127296603 |P1Thread1of1ForFork2_#t~ite15_Out-2127296603|) (= |P1Thread1of1ForFork2_#t~ite14_In-2127296603| |P1Thread1of1ForFork2_#t~ite14_Out-2127296603|)) (and (= |P1Thread1of1ForFork2_#t~ite15_Out-2127296603| |P1Thread1of1ForFork2_#t~ite14_Out-2127296603|) .cse0 (= ~y$w_buff0_used~0_In-2127296603 |P1Thread1of1ForFork2_#t~ite14_Out-2127296603|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-2127296603 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-2127296603 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-2127296603 256)) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In-2127296603 256)) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2127296603, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2127296603, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2127296603, ~weak$$choice2~0=~weak$$choice2~0_In-2127296603, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-2127296603|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2127296603} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2127296603, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2127296603, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2127296603, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-2127296603|, ~weak$$choice2~0=~weak$$choice2~0_In-2127296603, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-2127296603|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2127296603} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 16:50:02,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L768-->L769: Formula: (and (= v_~y$r_buff0_thd2~0_109 v_~y$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_15|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 16:50:02,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L769-->L769-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1051686668 256)))) (or (and (not .cse0) (= ~y$r_buff1_thd2~0_In1051686668 |P1Thread1of1ForFork2_#t~ite24_Out1051686668|) (= |P1Thread1of1ForFork2_#t~ite23_In1051686668| |P1Thread1of1ForFork2_#t~ite23_Out1051686668|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1051686668 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In1051686668 256)) (and (= 0 (mod ~y$w_buff1_used~0_In1051686668 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In1051686668 256)) .cse1))) (= |P1Thread1of1ForFork2_#t~ite23_Out1051686668| |P1Thread1of1ForFork2_#t~ite24_Out1051686668|) (= ~y$r_buff1_thd2~0_In1051686668 |P1Thread1of1ForFork2_#t~ite23_Out1051686668|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1051686668, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1051686668, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1051686668, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In1051686668|, ~weak$$choice2~0=~weak$$choice2~0_In1051686668, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1051686668} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1051686668, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1051686668, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1051686668, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out1051686668|, ~weak$$choice2~0=~weak$$choice2~0_In1051686668, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out1051686668|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1051686668} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 16:50:02,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L779: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= v_~y~0_19 v_~y$mem_tmp~0_4) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, ~y~0=v_~y~0_19, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 16:50:02,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L852-1-->L858: Formula: (and (= 4 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 16:50:02,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L858-2-->L858-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite43_Out-1829808608| |ULTIMATE.start_main_#t~ite42_Out-1829808608|)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1829808608 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1829808608 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~y~0_In-1829808608 |ULTIMATE.start_main_#t~ite42_Out-1829808608|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite42_Out-1829808608| ~y$w_buff1~0_In-1829808608) (not .cse1) (not .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1829808608, ~y~0=~y~0_In-1829808608, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1829808608, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1829808608} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1829808608, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1829808608|, ~y~0=~y~0_In-1829808608, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1829808608|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1829808608, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1829808608} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 16:50:02,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1600991130 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1600991130 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1600991130| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1600991130| ~y$w_buff0_used~0_In-1600991130)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1600991130, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1600991130} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1600991130, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1600991130, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1600991130|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 16:50:02,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L860-->L860-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1482256415 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1482256415 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1482256415 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1482256415 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1482256415|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1482256415 |ULTIMATE.start_main_#t~ite45_Out1482256415|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1482256415, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1482256415, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1482256415, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1482256415} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1482256415, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1482256415, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1482256415, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1482256415|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1482256415} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 16:50:02,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L861-->L861-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1993310073 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1993310073 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-1993310073| ~y$r_buff0_thd0~0_In-1993310073)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-1993310073| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1993310073, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1993310073} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1993310073, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1993310073, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1993310073|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 16:50:02,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L862-->L862-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In1116303200 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1116303200 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1116303200 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1116303200 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite47_Out1116303200|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In1116303200 |ULTIMATE.start_main_#t~ite47_Out1116303200|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1116303200, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1116303200, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1116303200, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1116303200} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1116303200, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1116303200, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1116303200|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1116303200, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1116303200} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 16:50:02,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L862-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p1_EAX~0_26) (= 2 v_~__unbuffered_p3_EAX~0_24) (= v_~__unbuffered_p1_EBX~0_25 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~y$r_buff1_thd0~0_153 |v_ULTIMATE.start_main_#t~ite47_41|) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~x~0_45 2) (= v_~main$tmp_guard1~0_19 0) (= v_~z~0_103 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_41|, ~z~0=v_~z~0_103, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_45} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~z~0=v_~z~0_103, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_45, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} 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-18 16:50:03,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:50:03 BasicIcfg [2019-12-18 16:50:03,012 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:50:03,014 INFO L168 Benchmark]: Toolchain (without parser) took 142638.87 ms. Allocated memory was 145.2 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 16:50:03,015 INFO L168 Benchmark]: CDTParser took 0.74 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 16:50:03,015 INFO L168 Benchmark]: CACSL2BoogieTranslator took 776.09 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.6 MB in the beginning and 155.9 MB in the end (delta: -54.3 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:50:03,015 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.19 ms. Allocated memory is still 202.4 MB. Free memory was 155.9 MB in the beginning and 153.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 16:50:03,016 INFO L168 Benchmark]: Boogie Preprocessor took 40.37 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 16:50:03,016 INFO L168 Benchmark]: RCFGBuilder took 836.17 ms. Allocated memory is still 202.4 MB. Free memory was 151.1 MB in the beginning and 101.7 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-18 16:50:03,017 INFO L168 Benchmark]: TraceAbstraction took 140918.56 ms. Allocated memory was 202.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 16:50:03,020 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.74 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 776.09 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.6 MB in the beginning and 155.9 MB in the end (delta: -54.3 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.19 ms. Allocated memory is still 202.4 MB. Free memory was 155.9 MB in the beginning and 153.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.37 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 836.17 ms. Allocated memory is still 202.4 MB. Free memory was 151.1 MB in the beginning and 101.7 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 140918.56 ms. Allocated memory was 202.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.3s, 181 ProgramPointsBefore, 88 ProgramPointsAfterwards, 209 TransitionsBefore, 95 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 7917 VarBasedMoverChecksPositive, 267 VarBasedMoverChecksNegative, 87 SemBasedMoverChecksPositive, 235 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 66461 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L846] FCALL, FORK 0 pthread_create(&t621, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t622, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] FCALL, FORK 0 pthread_create(&t623, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 3 y$w_buff1 = y$w_buff0 [L785] 3 y$w_buff0 = 1 [L786] 3 y$w_buff1_used = y$w_buff0_used [L787] 3 y$w_buff0_used = (_Bool)1 [L800] 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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=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] [L852] FCALL, FORK 0 pthread_create(&t624, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 4 z = 2 [L817] 4 __unbuffered_p3_EAX = z [L820] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 2 x = 2 [L756] 2 __unbuffered_p1_EAX = x [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 y$flush_delayed = weak$$choice2 [L762] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] 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) [L763] 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) [L801] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 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 [L824] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L825] 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 [L826] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L764] 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)) [L765] EXPR 2 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 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)) [L766] 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)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 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)) [L769] 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)) [L770] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L858] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 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 [L861] 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, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 140.6s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 45.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6699 SDtfs, 9827 SDslu, 27674 SDs, 0 SdLazy, 21117 SolverSat, 535 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 470 GetRequests, 48 SyntacticMatches, 14 SemanticMatches, 408 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2638 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160898occurred 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: 48.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 230795 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1304 NumberOfCodeBlocks, 1304 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1218 ConstructedInterpolants, 0 QuantifiedInterpolants, 253531 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...