/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:09:56,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:09:56,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:09:56,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:09:56,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:09:56,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:09:56,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:09:56,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:09:56,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:09:56,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:09:56,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:09:56,179 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:09:56,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:09:56,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:09:56,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:09:56,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:09:56,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:09:56,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:09:56,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:09:56,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:09:56,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:09:56,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:09:56,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:09:56,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:09:56,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:09:56,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:09:56,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:09:56,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:09:56,197 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:09:56,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:09:56,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:09:56,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:09:56,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:09:56,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:09:56,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:09:56,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:09:56,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:09:56,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:09:56,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:09:56,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:09:56,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:09:56,205 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 15:09:56,219 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:09:56,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:09:56,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:09:56,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:09:56,221 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:09:56,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:09:56,221 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:09:56,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:09:56,221 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:09:56,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:09:56,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:09:56,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:09:56,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:09:56,222 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:09:56,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:09:56,223 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:09:56,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:09:56,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:09:56,223 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:09:56,223 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:09:56,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:09:56,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:09:56,224 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:09:56,224 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:09:56,225 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:09:56,225 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:09:56,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:09:56,225 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:09:56,225 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:09:56,226 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:09:56,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:09:56,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:09:56,555 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:09:56,557 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:09:56,557 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:09:56,558 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i [2019-12-18 15:09:56,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2793475f5/74e1917418fb4a21abb2a9f136cb5eeb/FLAGb5fd958d6 [2019-12-18 15:09:57,215 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:09:57,215 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i [2019-12-18 15:09:57,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2793475f5/74e1917418fb4a21abb2a9f136cb5eeb/FLAGb5fd958d6 [2019-12-18 15:09:57,465 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2793475f5/74e1917418fb4a21abb2a9f136cb5eeb [2019-12-18 15:09:57,475 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:09:57,476 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:09:57,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:09:57,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:09:57,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:09:57,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:09:57" (1/1) ... [2019-12-18 15:09:57,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57c4e2b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:57, skipping insertion in model container [2019-12-18 15:09:57,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:09:57" (1/1) ... [2019-12-18 15:09:57,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:09:57,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:09:58,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:09:58,087 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:09:58,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:09:58,246 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:09:58,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:58 WrapperNode [2019-12-18 15:09:58,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:09:58,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:09:58,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:09:58,248 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:09:58,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:58" (1/1) ... [2019-12-18 15:09:58,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:58" (1/1) ... [2019-12-18 15:09:58,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:09:58,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:09:58,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:09:58,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:09:58,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:58" (1/1) ... [2019-12-18 15:09:58,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:58" (1/1) ... [2019-12-18 15:09:58,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:58" (1/1) ... [2019-12-18 15:09:58,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:58" (1/1) ... [2019-12-18 15:09:58,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:58" (1/1) ... [2019-12-18 15:09:58,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:58" (1/1) ... [2019-12-18 15:09:58,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:58" (1/1) ... [2019-12-18 15:09:58,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:09:58,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:09:58,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:09:58,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:09:58,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:58" (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 15:09:58,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:09:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 15:09:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:09:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:09:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 15:09:58,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 15:09:58,425 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 15:09:58,425 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 15:09:58,425 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 15:09:58,425 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 15:09:58,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 15:09:58,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:09:58,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:09:58,427 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 15:09:59,236 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:09:59,236 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 15:09:59,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:09:59 BoogieIcfgContainer [2019-12-18 15:09:59,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:09:59,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:09:59,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:09:59,242 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:09:59,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:09:57" (1/3) ... [2019-12-18 15:09:59,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a402064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:09:59, skipping insertion in model container [2019-12-18 15:09:59,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:58" (2/3) ... [2019-12-18 15:09:59,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a402064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:09:59, skipping insertion in model container [2019-12-18 15:09:59,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:09:59" (3/3) ... [2019-12-18 15:09:59,246 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_rmo.opt.i [2019-12-18 15:09:59,256 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:09:59,256 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:09:59,264 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 15:09:59,265 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:09:59,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,300 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,300 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,302 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,302 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,314 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,315 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,315 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,315 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,316 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,327 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,328 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,328 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,332 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,333 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,334 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,335 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:59,366 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 15:09:59,384 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:09:59,384 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:09:59,384 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:09:59,384 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:09:59,384 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:09:59,384 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:09:59,386 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:09:59,386 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:09:59,403 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-18 15:09:59,405 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 15:09:59,486 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 15:09:59,486 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:09:59,503 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 15:09:59,524 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 15:09:59,566 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 15:09:59,567 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:09:59,574 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 15:09:59,590 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 15:09:59,591 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:10:04,357 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 15:10:04,470 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 15:10:04,497 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48124 [2019-12-18 15:10:04,497 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 15:10:04,501 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 94 transitions [2019-12-18 15:10:05,456 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 15710 states. [2019-12-18 15:10:05,458 INFO L276 IsEmpty]: Start isEmpty. Operand 15710 states. [2019-12-18 15:10:05,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 15:10:05,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:05,467 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:10:05,467 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:05,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:05,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2126234855, now seen corresponding path program 1 times [2019-12-18 15:10:05,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:05,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179341600] [2019-12-18 15:10:05,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:05,726 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 15:10:05,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179341600] [2019-12-18 15:10:05,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:05,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:10:05,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666460003] [2019-12-18 15:10:05,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:10:05,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:05,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:10:05,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:10:05,752 INFO L87 Difference]: Start difference. First operand 15710 states. Second operand 3 states. [2019-12-18 15:10:06,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:06,201 INFO L93 Difference]: Finished difference Result 15638 states and 59348 transitions. [2019-12-18 15:10:06,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:10:06,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 15:10:06,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:06,376 INFO L225 Difference]: With dead ends: 15638 [2019-12-18 15:10:06,376 INFO L226 Difference]: Without dead ends: 15326 [2019-12-18 15:10:06,377 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 15:10:06,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15326 states. [2019-12-18 15:10:07,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15326 to 15326. [2019-12-18 15:10:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15326 states. [2019-12-18 15:10:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15326 states to 15326 states and 58230 transitions. [2019-12-18 15:10:07,925 INFO L78 Accepts]: Start accepts. Automaton has 15326 states and 58230 transitions. Word has length 7 [2019-12-18 15:10:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:07,926 INFO L462 AbstractCegarLoop]: Abstraction has 15326 states and 58230 transitions. [2019-12-18 15:10:07,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:10:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 15326 states and 58230 transitions. [2019-12-18 15:10:07,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:10:07,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:07,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:10:07,940 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:07,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:07,940 INFO L82 PathProgramCache]: Analyzing trace with hash -380072381, now seen corresponding path program 1 times [2019-12-18 15:10:07,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:07,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138552304] [2019-12-18 15:10:07,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:08,096 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 15:10:08,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138552304] [2019-12-18 15:10:08,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:08,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:10:08,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516560852] [2019-12-18 15:10:08,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:10:08,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:08,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:10:08,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:10:08,100 INFO L87 Difference]: Start difference. First operand 15326 states and 58230 transitions. Second operand 4 states. [2019-12-18 15:10:08,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:08,540 INFO L93 Difference]: Finished difference Result 24490 states and 89350 transitions. [2019-12-18 15:10:08,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:10:08,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 15:10:08,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:08,620 INFO L225 Difference]: With dead ends: 24490 [2019-12-18 15:10:08,620 INFO L226 Difference]: Without dead ends: 24476 [2019-12-18 15:10:08,622 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 15:10:08,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24476 states. [2019-12-18 15:10:09,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24476 to 22206. [2019-12-18 15:10:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22206 states. [2019-12-18 15:10:10,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22206 states to 22206 states and 82052 transitions. [2019-12-18 15:10:10,798 INFO L78 Accepts]: Start accepts. Automaton has 22206 states and 82052 transitions. Word has length 13 [2019-12-18 15:10:10,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:10,799 INFO L462 AbstractCegarLoop]: Abstraction has 22206 states and 82052 transitions. [2019-12-18 15:10:10,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:10:10,799 INFO L276 IsEmpty]: Start isEmpty. Operand 22206 states and 82052 transitions. [2019-12-18 15:10:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:10:10,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:10,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:10:10,801 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:10,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:10,802 INFO L82 PathProgramCache]: Analyzing trace with hash 691839138, now seen corresponding path program 1 times [2019-12-18 15:10:10,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:10,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534925248] [2019-12-18 15:10:10,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:10,863 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 15:10:10,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534925248] [2019-12-18 15:10:10,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:10,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:10:10,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453460872] [2019-12-18 15:10:10,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:10:10,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:10,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:10:10,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:10:10,865 INFO L87 Difference]: Start difference. First operand 22206 states and 82052 transitions. Second operand 3 states. [2019-12-18 15:10:10,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:10,934 INFO L93 Difference]: Finished difference Result 12702 states and 40687 transitions. [2019-12-18 15:10:10,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:10:10,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 15:10:10,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:10,977 INFO L225 Difference]: With dead ends: 12702 [2019-12-18 15:10:10,977 INFO L226 Difference]: Without dead ends: 12702 [2019-12-18 15:10:10,978 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 15:10:11,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12702 states. [2019-12-18 15:10:11,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12702 to 12702. [2019-12-18 15:10:11,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12702 states. [2019-12-18 15:10:11,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12702 states to 12702 states and 40687 transitions. [2019-12-18 15:10:11,356 INFO L78 Accepts]: Start accepts. Automaton has 12702 states and 40687 transitions. Word has length 13 [2019-12-18 15:10:11,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:11,356 INFO L462 AbstractCegarLoop]: Abstraction has 12702 states and 40687 transitions. [2019-12-18 15:10:11,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:10:11,356 INFO L276 IsEmpty]: Start isEmpty. Operand 12702 states and 40687 transitions. [2019-12-18 15:10:11,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 15:10:11,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:11,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:10:11,358 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:11,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:11,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1718037058, now seen corresponding path program 1 times [2019-12-18 15:10:11,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:11,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939119738] [2019-12-18 15:10:11,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:11,407 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 15:10:11,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939119738] [2019-12-18 15:10:11,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:11,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:10:11,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794507266] [2019-12-18 15:10:11,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:10:11,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:11,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:10:11,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:10:11,412 INFO L87 Difference]: Start difference. First operand 12702 states and 40687 transitions. Second operand 4 states. [2019-12-18 15:10:11,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:11,434 INFO L93 Difference]: Finished difference Result 1935 states and 4569 transitions. [2019-12-18 15:10:11,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:10:11,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 15:10:11,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:11,439 INFO L225 Difference]: With dead ends: 1935 [2019-12-18 15:10:11,439 INFO L226 Difference]: Without dead ends: 1935 [2019-12-18 15:10:11,439 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 15:10:11,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-18 15:10:11,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-18 15:10:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-18 15:10:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4569 transitions. [2019-12-18 15:10:11,473 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4569 transitions. Word has length 14 [2019-12-18 15:10:11,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:11,474 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4569 transitions. [2019-12-18 15:10:11,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:10:11,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4569 transitions. [2019-12-18 15:10:11,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 15:10:11,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:11,476 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:10:11,477 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:11,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:11,477 INFO L82 PathProgramCache]: Analyzing trace with hash 968226525, now seen corresponding path program 1 times [2019-12-18 15:10:11,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:11,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950032908] [2019-12-18 15:10:11,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:11,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:10:11,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950032908] [2019-12-18 15:10:11,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:11,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:10:11,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650923575] [2019-12-18 15:10:11,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:10:11,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:11,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:10:11,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:10:11,559 INFO L87 Difference]: Start difference. First operand 1935 states and 4569 transitions. Second operand 5 states. [2019-12-18 15:10:11,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:11,581 INFO L93 Difference]: Finished difference Result 630 states and 1476 transitions. [2019-12-18 15:10:11,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:10:11,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 15:10:11,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:11,583 INFO L225 Difference]: With dead ends: 630 [2019-12-18 15:10:11,583 INFO L226 Difference]: Without dead ends: 630 [2019-12-18 15:10:11,584 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 15:10:11,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-12-18 15:10:11,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 574. [2019-12-18 15:10:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-12-18 15:10:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1344 transitions. [2019-12-18 15:10:11,594 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1344 transitions. Word has length 26 [2019-12-18 15:10:11,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:11,594 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 1344 transitions. [2019-12-18 15:10:11,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:10:11,594 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1344 transitions. [2019-12-18 15:10:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 15:10:11,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:11,597 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] [2019-12-18 15:10:11,597 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:11,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:11,597 INFO L82 PathProgramCache]: Analyzing trace with hash 196092715, now seen corresponding path program 1 times [2019-12-18 15:10:11,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:11,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016815909] [2019-12-18 15:10:11,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:11,713 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 15:10:11,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016815909] [2019-12-18 15:10:11,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:11,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:10:11,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441852876] [2019-12-18 15:10:11,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:10:11,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:11,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:10:11,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:10:11,715 INFO L87 Difference]: Start difference. First operand 574 states and 1344 transitions. Second operand 3 states. [2019-12-18 15:10:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:11,768 INFO L93 Difference]: Finished difference Result 584 states and 1354 transitions. [2019-12-18 15:10:11,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:10:11,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 15:10:11,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:11,771 INFO L225 Difference]: With dead ends: 584 [2019-12-18 15:10:11,771 INFO L226 Difference]: Without dead ends: 584 [2019-12-18 15:10:11,771 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 15:10:11,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-12-18 15:10:11,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 580. [2019-12-18 15:10:11,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-18 15:10:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1350 transitions. [2019-12-18 15:10:11,780 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1350 transitions. Word has length 55 [2019-12-18 15:10:11,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:11,781 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 1350 transitions. [2019-12-18 15:10:11,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:10:11,781 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1350 transitions. [2019-12-18 15:10:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 15:10:11,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:11,783 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] [2019-12-18 15:10:11,784 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:11,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:11,784 INFO L82 PathProgramCache]: Analyzing trace with hash -922835002, now seen corresponding path program 1 times [2019-12-18 15:10:11,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:11,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943672477] [2019-12-18 15:10:11,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:11,894 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 15:10:11,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943672477] [2019-12-18 15:10:11,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:11,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:10:11,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470759238] [2019-12-18 15:10:11,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:10:11,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:11,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:10:11,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:10:11,896 INFO L87 Difference]: Start difference. First operand 580 states and 1350 transitions. Second operand 3 states. [2019-12-18 15:10:11,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:11,917 INFO L93 Difference]: Finished difference Result 580 states and 1326 transitions. [2019-12-18 15:10:11,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:10:11,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 15:10:11,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:11,919 INFO L225 Difference]: With dead ends: 580 [2019-12-18 15:10:11,920 INFO L226 Difference]: Without dead ends: 580 [2019-12-18 15:10:11,920 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 15:10:11,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-12-18 15:10:11,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-12-18 15:10:11,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-18 15:10:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1326 transitions. [2019-12-18 15:10:12,032 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1326 transitions. Word has length 55 [2019-12-18 15:10:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:12,032 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 1326 transitions. [2019-12-18 15:10:12,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:10:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1326 transitions. [2019-12-18 15:10:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:10:12,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:12,035 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] [2019-12-18 15:10:12,035 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:12,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:12,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1916501781, now seen corresponding path program 1 times [2019-12-18 15:10:12,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:12,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859249172] [2019-12-18 15:10:12,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:12,147 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 15:10:12,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859249172] [2019-12-18 15:10:12,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:12,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:10:12,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422124623] [2019-12-18 15:10:12,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:10:12,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:12,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:10:12,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:10:12,149 INFO L87 Difference]: Start difference. First operand 580 states and 1326 transitions. Second operand 5 states. [2019-12-18 15:10:12,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:12,371 INFO L93 Difference]: Finished difference Result 851 states and 1949 transitions. [2019-12-18 15:10:12,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:10:12,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-18 15:10:12,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:12,374 INFO L225 Difference]: With dead ends: 851 [2019-12-18 15:10:12,374 INFO L226 Difference]: Without dead ends: 851 [2019-12-18 15:10:12,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:10:12,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-12-18 15:10:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 664. [2019-12-18 15:10:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-12-18 15:10:12,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1530 transitions. [2019-12-18 15:10:12,387 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1530 transitions. Word has length 56 [2019-12-18 15:10:12,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:12,388 INFO L462 AbstractCegarLoop]: Abstraction has 664 states and 1530 transitions. [2019-12-18 15:10:12,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:10:12,388 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1530 transitions. [2019-12-18 15:10:12,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:10:12,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:12,390 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] [2019-12-18 15:10:12,391 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:12,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:12,391 INFO L82 PathProgramCache]: Analyzing trace with hash 510672277, now seen corresponding path program 2 times [2019-12-18 15:10:12,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:12,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124150806] [2019-12-18 15:10:12,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:12,752 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 15:10:12,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124150806] [2019-12-18 15:10:12,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:12,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:10:12,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735475126] [2019-12-18 15:10:12,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 15:10:12,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:12,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 15:10:12,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:10:12,759 INFO L87 Difference]: Start difference. First operand 664 states and 1530 transitions. Second operand 10 states. [2019-12-18 15:10:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:13,033 INFO L93 Difference]: Finished difference Result 922 states and 2104 transitions. [2019-12-18 15:10:13,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:10:13,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-18 15:10:13,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:13,035 INFO L225 Difference]: With dead ends: 922 [2019-12-18 15:10:13,036 INFO L226 Difference]: Without dead ends: 922 [2019-12-18 15:10:13,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:10:13,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2019-12-18 15:10:13,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 678. [2019-12-18 15:10:13,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-12-18 15:10:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1563 transitions. [2019-12-18 15:10:13,050 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1563 transitions. Word has length 56 [2019-12-18 15:10:13,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:13,051 INFO L462 AbstractCegarLoop]: Abstraction has 678 states and 1563 transitions. [2019-12-18 15:10:13,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 15:10:13,051 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1563 transitions. [2019-12-18 15:10:13,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:10:13,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:13,054 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] [2019-12-18 15:10:13,054 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:13,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:13,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1314270907, now seen corresponding path program 3 times [2019-12-18 15:10:13,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:13,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686084653] [2019-12-18 15:10:13,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:13,425 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 15:10:13,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686084653] [2019-12-18 15:10:13,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:13,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 15:10:13,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722817547] [2019-12-18 15:10:13,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:10:13,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:13,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:10:13,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:10:13,427 INFO L87 Difference]: Start difference. First operand 678 states and 1563 transitions. Second operand 11 states. [2019-12-18 15:10:14,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:14,076 INFO L93 Difference]: Finished difference Result 1049 states and 2360 transitions. [2019-12-18 15:10:14,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:10:14,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 15:10:14,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:14,078 INFO L225 Difference]: With dead ends: 1049 [2019-12-18 15:10:14,078 INFO L226 Difference]: Without dead ends: 1049 [2019-12-18 15:10:14,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2019-12-18 15:10:14,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-12-18 15:10:14,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 650. [2019-12-18 15:10:14,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-12-18 15:10:14,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1477 transitions. [2019-12-18 15:10:14,092 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1477 transitions. Word has length 56 [2019-12-18 15:10:14,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:14,092 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 1477 transitions. [2019-12-18 15:10:14,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:10:14,092 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1477 transitions. [2019-12-18 15:10:14,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:10:14,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:14,094 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] [2019-12-18 15:10:14,095 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:14,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:14,095 INFO L82 PathProgramCache]: Analyzing trace with hash 69556479, now seen corresponding path program 4 times [2019-12-18 15:10:14,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:14,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11303404] [2019-12-18 15:10:14,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:14,196 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 15:10:14,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11303404] [2019-12-18 15:10:14,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:14,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:10:14,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553706958] [2019-12-18 15:10:14,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:10:14,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:14,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:10:14,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:10:14,199 INFO L87 Difference]: Start difference. First operand 650 states and 1477 transitions. Second operand 5 states. [2019-12-18 15:10:14,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:14,322 INFO L93 Difference]: Finished difference Result 931 states and 1970 transitions. [2019-12-18 15:10:14,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:10:14,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-18 15:10:14,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:14,323 INFO L225 Difference]: With dead ends: 931 [2019-12-18 15:10:14,323 INFO L226 Difference]: Without dead ends: 584 [2019-12-18 15:10:14,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:10:14,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-12-18 15:10:14,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-12-18 15:10:14,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-12-18 15:10:14,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1286 transitions. [2019-12-18 15:10:14,335 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1286 transitions. Word has length 56 [2019-12-18 15:10:14,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:14,335 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 1286 transitions. [2019-12-18 15:10:14,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:10:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1286 transitions. [2019-12-18 15:10:14,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:10:14,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:14,337 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] [2019-12-18 15:10:14,337 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:14,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:14,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1040007325, now seen corresponding path program 5 times [2019-12-18 15:10:14,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:14,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611515569] [2019-12-18 15:10:14,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:14,771 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 15:10:14,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611515569] [2019-12-18 15:10:14,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:14,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:10:14,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856903672] [2019-12-18 15:10:14,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:10:14,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:14,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:10:14,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:10:14,774 INFO L87 Difference]: Start difference. First operand 584 states and 1286 transitions. Second operand 13 states. [2019-12-18 15:10:15,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:15,524 INFO L93 Difference]: Finished difference Result 1036 states and 2175 transitions. [2019-12-18 15:10:15,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:10:15,525 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-12-18 15:10:15,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:15,526 INFO L225 Difference]: With dead ends: 1036 [2019-12-18 15:10:15,526 INFO L226 Difference]: Without dead ends: 657 [2019-12-18 15:10:15,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:10:15,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-12-18 15:10:15,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 543. [2019-12-18 15:10:15,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-12-18 15:10:15,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1046 transitions. [2019-12-18 15:10:15,539 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 1046 transitions. Word has length 56 [2019-12-18 15:10:15,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:15,539 INFO L462 AbstractCegarLoop]: Abstraction has 543 states and 1046 transitions. [2019-12-18 15:10:15,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:10:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1046 transitions. [2019-12-18 15:10:15,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:10:15,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:15,542 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] [2019-12-18 15:10:15,542 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:15,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:15,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1342487137, now seen corresponding path program 6 times [2019-12-18 15:10:15,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:15,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974858776] [2019-12-18 15:10:15,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:15,914 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 15:10:15,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974858776] [2019-12-18 15:10:15,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:15,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:10:15,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553448041] [2019-12-18 15:10:15,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:10:15,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:15,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:10:15,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:10:15,916 INFO L87 Difference]: Start difference. First operand 543 states and 1046 transitions. Second operand 13 states. [2019-12-18 15:10:16,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:16,781 INFO L93 Difference]: Finished difference Result 906 states and 1734 transitions. [2019-12-18 15:10:16,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:10:16,782 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-12-18 15:10:16,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:16,783 INFO L225 Difference]: With dead ends: 906 [2019-12-18 15:10:16,784 INFO L226 Difference]: Without dead ends: 725 [2019-12-18 15:10:16,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:10:16,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-12-18 15:10:16,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 641. [2019-12-18 15:10:16,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-12-18 15:10:16,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1238 transitions. [2019-12-18 15:10:16,798 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1238 transitions. Word has length 56 [2019-12-18 15:10:16,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:16,798 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 1238 transitions. [2019-12-18 15:10:16,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:10:16,798 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1238 transitions. [2019-12-18 15:10:16,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:10:16,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:16,801 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] [2019-12-18 15:10:16,801 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:16,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:16,802 INFO L82 PathProgramCache]: Analyzing trace with hash 124182097, now seen corresponding path program 7 times [2019-12-18 15:10:16,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:16,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602924733] [2019-12-18 15:10:16,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:17,106 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 15:10:17,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602924733] [2019-12-18 15:10:17,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:17,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 15:10:17,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273232789] [2019-12-18 15:10:17,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:10:17,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:17,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:10:17,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:10:17,108 INFO L87 Difference]: Start difference. First operand 641 states and 1238 transitions. Second operand 9 states. [2019-12-18 15:10:17,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:17,645 INFO L93 Difference]: Finished difference Result 905 states and 1747 transitions. [2019-12-18 15:10:17,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:10:17,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-18 15:10:17,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:17,647 INFO L225 Difference]: With dead ends: 905 [2019-12-18 15:10:17,647 INFO L226 Difference]: Without dead ends: 905 [2019-12-18 15:10:17,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:10:17,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-12-18 15:10:17,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 647. [2019-12-18 15:10:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-12-18 15:10:17,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1249 transitions. [2019-12-18 15:10:17,660 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1249 transitions. Word has length 56 [2019-12-18 15:10:17,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:17,660 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 1249 transitions. [2019-12-18 15:10:17,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:10:17,661 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1249 transitions. [2019-12-18 15:10:17,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:10:17,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:17,663 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] [2019-12-18 15:10:17,663 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:17,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:17,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1328380603, now seen corresponding path program 8 times [2019-12-18 15:10:17,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:17,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205953169] [2019-12-18 15:10:17,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:17,725 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 15:10:17,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205953169] [2019-12-18 15:10:17,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:17,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:10:17,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667236861] [2019-12-18 15:10:17,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:10:17,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:17,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:10:17,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:10:17,727 INFO L87 Difference]: Start difference. First operand 647 states and 1249 transitions. Second operand 3 states. [2019-12-18 15:10:17,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:17,768 INFO L93 Difference]: Finished difference Result 647 states and 1248 transitions. [2019-12-18 15:10:17,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:10:17,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 15:10:17,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:17,770 INFO L225 Difference]: With dead ends: 647 [2019-12-18 15:10:17,770 INFO L226 Difference]: Without dead ends: 647 [2019-12-18 15:10:17,770 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 15:10:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-12-18 15:10:17,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 482. [2019-12-18 15:10:17,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-12-18 15:10:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 927 transitions. [2019-12-18 15:10:17,780 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 927 transitions. Word has length 56 [2019-12-18 15:10:17,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:17,780 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 927 transitions. [2019-12-18 15:10:17,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:10:17,780 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 927 transitions. [2019-12-18 15:10:17,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 15:10:17,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:17,782 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 15:10:17,782 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:17,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:17,782 INFO L82 PathProgramCache]: Analyzing trace with hash 574299964, now seen corresponding path program 1 times [2019-12-18 15:10:17,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:17,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929181539] [2019-12-18 15:10:17,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:17,892 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 15:10:17,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929181539] [2019-12-18 15:10:17,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:17,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:10:17,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189961060] [2019-12-18 15:10:17,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:10:17,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:17,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:10:17,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:10:17,894 INFO L87 Difference]: Start difference. First operand 482 states and 927 transitions. Second operand 7 states. [2019-12-18 15:10:18,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:18,003 INFO L93 Difference]: Finished difference Result 642 states and 1197 transitions. [2019-12-18 15:10:18,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 15:10:18,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 15:10:18,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:18,004 INFO L225 Difference]: With dead ends: 642 [2019-12-18 15:10:18,005 INFO L226 Difference]: Without dead ends: 219 [2019-12-18 15:10:18,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:10:18,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-12-18 15:10:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2019-12-18 15:10:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-12-18 15:10:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 324 transitions. [2019-12-18 15:10:18,009 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 324 transitions. Word has length 57 [2019-12-18 15:10:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:18,009 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 324 transitions. [2019-12-18 15:10:18,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:10:18,010 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 324 transitions. [2019-12-18 15:10:18,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 15:10:18,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:18,010 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 15:10:18,010 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:18,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:18,011 INFO L82 PathProgramCache]: Analyzing trace with hash -431408076, now seen corresponding path program 2 times [2019-12-18 15:10:18,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:18,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601631397] [2019-12-18 15:10:18,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:18,224 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 15:10:18,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601631397] [2019-12-18 15:10:18,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:18,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:10:18,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936549460] [2019-12-18 15:10:18,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:10:18,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:18,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:10:18,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:10:18,226 INFO L87 Difference]: Start difference. First operand 195 states and 324 transitions. Second operand 13 states. [2019-12-18 15:10:18,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:18,793 INFO L93 Difference]: Finished difference Result 364 states and 602 transitions. [2019-12-18 15:10:18,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:10:18,794 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 15:10:18,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:18,795 INFO L225 Difference]: With dead ends: 364 [2019-12-18 15:10:18,795 INFO L226 Difference]: Without dead ends: 329 [2019-12-18 15:10:18,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2019-12-18 15:10:18,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-12-18 15:10:18,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 295. [2019-12-18 15:10:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-12-18 15:10:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 495 transitions. [2019-12-18 15:10:18,802 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 495 transitions. Word has length 57 [2019-12-18 15:10:18,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:18,803 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 495 transitions. [2019-12-18 15:10:18,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:10:18,803 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 495 transitions. [2019-12-18 15:10:18,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 15:10:18,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:18,804 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 15:10:18,804 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:18,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:18,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1239613688, now seen corresponding path program 3 times [2019-12-18 15:10:18,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:18,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870719615] [2019-12-18 15:10:18,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:19,067 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 15:10:19,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870719615] [2019-12-18 15:10:19,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:19,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:10:19,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242492501] [2019-12-18 15:10:19,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:10:19,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:19,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:10:19,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:10:19,070 INFO L87 Difference]: Start difference. First operand 295 states and 495 transitions. Second operand 14 states. [2019-12-18 15:10:19,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:19,718 INFO L93 Difference]: Finished difference Result 400 states and 653 transitions. [2019-12-18 15:10:19,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:10:19,719 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-18 15:10:19,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:19,720 INFO L225 Difference]: With dead ends: 400 [2019-12-18 15:10:19,720 INFO L226 Difference]: Without dead ends: 365 [2019-12-18 15:10:19,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2019-12-18 15:10:19,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-12-18 15:10:19,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 303. [2019-12-18 15:10:19,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-12-18 15:10:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 509 transitions. [2019-12-18 15:10:19,725 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 509 transitions. Word has length 57 [2019-12-18 15:10:19,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:19,725 INFO L462 AbstractCegarLoop]: Abstraction has 303 states and 509 transitions. [2019-12-18 15:10:19,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:10:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 509 transitions. [2019-12-18 15:10:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 15:10:19,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:19,726 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 15:10:19,727 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:19,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:19,727 INFO L82 PathProgramCache]: Analyzing trace with hash -97225810, now seen corresponding path program 4 times [2019-12-18 15:10:19,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:19,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825561505] [2019-12-18 15:10:19,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:10:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:10:19,832 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:10:19,832 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:10:19,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~y$w_buff1~0_198 0) (= v_~x~0_55 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t2528~0.base_22|) 0) (= v_~weak$$choice2~0_120 0) (= v_~main$tmp_guard1~0_31 0) (= v_~y$r_buff1_thd0~0_279 0) (= 0 v_~y$r_buff1_thd2~0_191) (= v_~y$read_delayed~0_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2528~0.base_22| 1) |v_#valid_53|) (= 0 v_~y$w_buff0~0_215) (= 0 v_~y$r_buff0_thd3~0_201) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff0_thd0~0_331 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2528~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2528~0.base_22|) |v_ULTIMATE.start_main_~#t2528~0.offset_17| 0)) |v_#memory_int_19|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2528~0.base_22| 4)) (= v_~y$r_buff0_thd1~0_37 0) (= v_~y$w_buff0_used~0_623 0) (= 0 |v_#NULL.base_4|) (= v_~y~0_147 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2528~0.base_22|) (= 0 v_~__unbuffered_p0_EAX~0_42) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$mem_tmp~0_20 0) (= 0 v_~weak$$choice0~0_16) (= 0 v_~y$flush_delayed~0_42) (= 0 v_~y$r_buff0_thd2~0_116) (= v_~y$w_buff1_used~0_397 0) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard0~0_26 0) (= |v_ULTIMATE.start_main_~#t2528~0.offset_17| 0) (= 0 v_~y$r_buff1_thd3~0_162) (= v_~z~0_148 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~y$r_buff1_thd1~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_40|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_23|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_23|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_46|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_25|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_162, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_37, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, #length=|v_#length_21|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_27|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_28|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_35|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_60|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_65|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ~y$w_buff1~0=v_~y$w_buff1~0_198, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_116, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_279, ~x~0=v_~x~0_55, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_623, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_44|, ULTIMATE.start_main_~#t2530~0.base=|v_ULTIMATE.start_main_~#t2530~0.base_18|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_31|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_129|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_28|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_37|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_~#t2529~0.offset=|v_ULTIMATE.start_main_~#t2529~0.offset_15|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_116, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_25|, ~y$w_buff0~0=v_~y$w_buff0~0_215, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_201, ~y~0=v_~y~0_147, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_31|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_34|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_64|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_24|, ULTIMATE.start_main_~#t2529~0.base=|v_ULTIMATE.start_main_~#t2529~0.base_19|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_191, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_33|, ULTIMATE.start_main_~#t2528~0.base=|v_ULTIMATE.start_main_~#t2528~0.base_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_331, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_148, ~weak$$choice2~0=v_~weak$$choice2~0_120, ULTIMATE.start_main_~#t2530~0.offset=|v_ULTIMATE.start_main_~#t2530~0.offset_15|, ULTIMATE.start_main_~#t2528~0.offset=|v_ULTIMATE.start_main_~#t2528~0.offset_17|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_397} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t2530~0.base, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2529~0.offset, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t2529~0.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2528~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t2530~0.offset, ULTIMATE.start_main_~#t2528~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 15:10:19,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L802-1-->L804: Formula: (and (= |v_ULTIMATE.start_main_~#t2529~0.offset_10| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2529~0.base_11|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2529~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t2529~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2529~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2529~0.base_11|) |v_ULTIMATE.start_main_~#t2529~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2529~0.base_11| 4)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2529~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2529~0.base=|v_ULTIMATE.start_main_~#t2529~0.base_11|, ULTIMATE.start_main_~#t2529~0.offset=|v_ULTIMATE.start_main_~#t2529~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2529~0.base, ULTIMATE.start_main_~#t2529~0.offset] because there is no mapped edge [2019-12-18 15:10:19,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L804-1-->L806: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2530~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2530~0.base_10|) |v_ULTIMATE.start_main_~#t2530~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2530~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t2530~0.base_10| 0)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2530~0.base_10|)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2530~0.base_10| 1)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2530~0.base_10| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t2530~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2530~0.base=|v_ULTIMATE.start_main_~#t2530~0.base_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2530~0.offset=|v_ULTIMATE.start_main_~#t2530~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2530~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t2530~0.offset] because there is no mapped edge [2019-12-18 15:10:19,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [616] [616] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0~0_29 v_~y$w_buff1~0_24) (= 2 v_~y$w_buff0~0_28) (= |v_P2Thread1of1ForFork0_#in~arg.base_11| v_P2Thread1of1ForFork0_~arg.base_11) (= v_~y$w_buff0_used~0_103 1) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_11| v_P2Thread1of1ForFork0_~arg.offset_11) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= v_~y$w_buff1_used~0_54 v_~y$w_buff0_used~0_104) (= 0 (mod v_~y$w_buff1_used~0_54 256))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_11|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_29, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_11|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_11, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_11|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_28, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_11, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_11|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_54} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 15:10:19,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_15| 0) (= 0 |v_P0Thread1of1ForFork1_#res.offset_15|) (= v_~x~0_47 v_~__unbuffered_p0_EAX~0_32) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_~z~0_109 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_47} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_15|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, ~z~0=v_~z~0_109, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_47, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 15:10:19,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In2054411743 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2054411743 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In2054411743 |P2Thread1of1ForFork0_#t~ite11_Out2054411743|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite11_Out2054411743|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2054411743, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2054411743} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2054411743, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out2054411743|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2054411743} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 15:10:19,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L750-2-->L750-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork2_#t~ite4_Out-334713487| |P1Thread1of1ForFork2_#t~ite3_Out-334713487|)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-334713487 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-334713487 256)))) (or (and (not .cse0) .cse1 (= ~y$w_buff1~0_In-334713487 |P1Thread1of1ForFork2_#t~ite3_Out-334713487|) (not .cse2)) (and .cse1 (= ~y~0_In-334713487 |P1Thread1of1ForFork2_#t~ite3_Out-334713487|) (or .cse0 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-334713487, ~y$w_buff1~0=~y$w_buff1~0_In-334713487, ~y~0=~y~0_In-334713487, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-334713487} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-334713487, ~y$w_buff1~0=~y$w_buff1~0_In-334713487, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out-334713487|, ~y~0=~y~0_In-334713487, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-334713487|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-334713487} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 15:10:19,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-469867563 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-469867563 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite5_Out-469867563| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-469867563 |P1Thread1of1ForFork2_#t~ite5_Out-469867563|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-469867563, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-469867563} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-469867563, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-469867563, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-469867563|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 15:10:19,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-1908761422 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1908761422 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1908761422 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1908761422 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite12_Out-1908761422| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite12_Out-1908761422| ~y$w_buff1_used~0_In-1908761422)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1908761422, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1908761422, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1908761422, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1908761422} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1908761422, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1908761422, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-1908761422|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1908761422, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1908761422} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 15:10:19,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1072895271 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1072895271 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1072895271 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1072895271 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite6_Out1072895271| ~y$w_buff1_used~0_In1072895271) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork2_#t~ite6_Out1072895271| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1072895271, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1072895271, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1072895271, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1072895271} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1072895271, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1072895271, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1072895271, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out1072895271|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1072895271} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 15:10:19,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L753-->L753-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In591889103 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In591889103 256)))) (or (and (= ~y$r_buff0_thd2~0_In591889103 |P1Thread1of1ForFork2_#t~ite7_Out591889103|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite7_Out591889103|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In591889103, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In591889103} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In591889103, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In591889103, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out591889103|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 15:10:19,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L754-->L754-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In65183030 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In65183030 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In65183030 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In65183030 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In65183030 |P1Thread1of1ForFork2_#t~ite8_Out65183030|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out65183030|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In65183030, ~y$w_buff0_used~0=~y$w_buff0_used~0_In65183030, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In65183030, ~y$w_buff1_used~0=~y$w_buff1_used~0_In65183030} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In65183030, ~y$w_buff0_used~0=~y$w_buff0_used~0_In65183030, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out65183030|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In65183030, ~y$w_buff1_used~0=~y$w_buff1_used~0_In65183030} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 15:10:19,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L754-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= |v_P1Thread1of1ForFork2_#t~ite8_26| v_~y$r_buff1_thd2~0_103) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_103, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 15:10:19,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L782-->L783: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1986832983 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1986832983 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1986832983 ~y$r_buff0_thd3~0_Out-1986832983)) (and (not .cse1) (= ~y$r_buff0_thd3~0_Out-1986832983 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1986832983, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1986832983} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1986832983, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1986832983, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-1986832983|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 15:10:19,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L783-->L783-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-840761660 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-840761660 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-840761660 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-840761660 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite14_Out-840761660| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite14_Out-840761660| ~y$r_buff1_thd3~0_In-840761660)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-840761660, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-840761660, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-840761660, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-840761660} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-840761660|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-840761660, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-840761660, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-840761660, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-840761660} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 15:10:19,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L783-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_26| v_~y$r_buff1_thd3~0_99) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_25|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_99, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 15:10:19,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [614] [614] L806-1-->L812: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 15:10:19,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L812-2-->L812-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite19_Out490103326| |ULTIMATE.start_main_#t~ite18_Out490103326|)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In490103326 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In490103326 256)))) (or (and (= |ULTIMATE.start_main_#t~ite18_Out490103326| ~y~0_In490103326) (or .cse0 .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite18_Out490103326| ~y$w_buff1~0_In490103326) .cse2 (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In490103326, ~y~0=~y~0_In490103326, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In490103326, ~y$w_buff1_used~0=~y$w_buff1_used~0_In490103326} OutVars{~y$w_buff1~0=~y$w_buff1~0_In490103326, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out490103326|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out490103326|, ~y~0=~y~0_In490103326, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In490103326, ~y$w_buff1_used~0=~y$w_buff1_used~0_In490103326} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 15:10:19,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-357912975 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-357912975 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-357912975 |ULTIMATE.start_main_#t~ite20_Out-357912975|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out-357912975|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-357912975, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-357912975} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-357912975, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-357912975, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-357912975|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 15:10:19,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-136478591 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-136478591 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-136478591 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-136478591 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-136478591|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-136478591 |ULTIMATE.start_main_#t~ite21_Out-136478591|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-136478591, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-136478591, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-136478591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-136478591} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-136478591, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-136478591, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-136478591|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-136478591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-136478591} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 15:10:19,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In460572758 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In460572758 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out460572758| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite22_Out460572758| ~y$r_buff0_thd0~0_In460572758) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In460572758, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In460572758} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In460572758, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In460572758, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out460572758|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 15:10:19,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L816-->L816-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In1390831742 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1390831742 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1390831742 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1390831742 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite23_Out1390831742|)) (and (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In1390831742 |ULTIMATE.start_main_#t~ite23_Out1390831742|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1390831742, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1390831742, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1390831742, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1390831742} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1390831742, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1390831742, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1390831742, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1390831742|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1390831742} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 15:10:19,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L827-->L827-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1195278589 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In-1195278589| |ULTIMATE.start_main_#t~ite38_Out-1195278589|) (= |ULTIMATE.start_main_#t~ite39_Out-1195278589| ~y$w_buff1_used~0_In-1195278589)) (and (= |ULTIMATE.start_main_#t~ite39_Out-1195278589| |ULTIMATE.start_main_#t~ite38_Out-1195278589|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1195278589 256)))) (or (and (= 0 (mod ~y$r_buff1_thd0~0_In-1195278589 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1195278589 256)) (and (= (mod ~y$w_buff1_used~0_In-1195278589 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite38_Out-1195278589| ~y$w_buff1_used~0_In-1195278589) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1195278589, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1195278589, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1195278589|, ~weak$$choice2~0=~weak$$choice2~0_In-1195278589, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1195278589, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1195278589} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1195278589, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1195278589|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1195278589, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1195278589|, ~weak$$choice2~0=~weak$$choice2~0_In-1195278589, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1195278589, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1195278589} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 15:10:19,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L828-->L829: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~y$r_buff0_thd0~0_98 v_~y$r_buff0_thd0~0_97)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_25, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 15:10:19,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L831-->L4: Formula: (and (= v_~y~0_99 v_~y$mem_tmp~0_10) (not (= (mod v_~y$flush_delayed~0_27 256) 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4| (mod v_~main$tmp_guard1~0_12 256)) (= 0 v_~y$flush_delayed~0_26)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_99, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 15:10:19,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 15:10:19,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:10:19 BasicIcfg [2019-12-18 15:10:19,956 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:10:19,957 INFO L168 Benchmark]: Toolchain (without parser) took 22481.30 ms. Allocated memory was 145.2 MB in the beginning and 910.7 MB in the end (delta: 765.5 MB). Free memory was 100.2 MB in the beginning and 604.8 MB in the end (delta: -504.6 MB). Peak memory consumption was 260.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:10:19,958 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 145.2 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 15:10:19,958 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.93 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 99.7 MB in the beginning and 155.8 MB in the end (delta: -56.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 15:10:19,959 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.43 ms. Allocated memory is still 201.9 MB. Free memory was 155.8 MB in the beginning and 152.0 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:10:19,960 INFO L168 Benchmark]: Boogie Preprocessor took 40.71 ms. Allocated memory is still 201.9 MB. Free memory was 152.0 MB in the beginning and 150.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 15:10:19,962 INFO L168 Benchmark]: RCFGBuilder took 876.64 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 104.0 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2019-12-18 15:10:19,963 INFO L168 Benchmark]: TraceAbstraction took 20716.86 ms. Allocated memory was 201.9 MB in the beginning and 910.7 MB in the end (delta: 708.8 MB). Free memory was 103.0 MB in the beginning and 604.8 MB in the end (delta: -501.7 MB). Peak memory consumption was 207.1 MB. Max. memory is 7.1 GB. [2019-12-18 15:10:19,968 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.56 ms. Allocated memory is still 145.2 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 769.93 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 99.7 MB in the beginning and 155.8 MB in the end (delta: -56.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.43 ms. Allocated memory is still 201.9 MB. Free memory was 155.8 MB in the beginning and 152.0 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.71 ms. Allocated memory is still 201.9 MB. Free memory was 152.0 MB in the beginning and 150.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 876.64 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 104.0 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20716.86 ms. Allocated memory was 201.9 MB in the beginning and 910.7 MB in the end (delta: 708.8 MB). Free memory was 103.0 MB in the beginning and 604.8 MB in the end (delta: -501.7 MB). Peak memory consumption was 207.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 94 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 24 ChoiceCompositions, 4225 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 61 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 48124 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t2528, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L804] FCALL, FORK 0 pthread_create(&t2529, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L806] FCALL, FORK 0 pthread_create(&t2530, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L769] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L770] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L771] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L772] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L773] 3 y$r_buff0_thd3 = (_Bool)1 [L776] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L744] 2 x = 1 [L747] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L779] 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) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L780] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L750] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L751] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 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 [L812] 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=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L812] 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) [L813] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L814] 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 [L815] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L816] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L819] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 0 y$flush_delayed = weak$$choice2 [L822] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L826] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L829] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 20.4s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1832 SDtfs, 2178 SDslu, 5612 SDs, 0 SdLazy, 3197 SolverSat, 207 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 17 SyntacticMatches, 17 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22206occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 3901 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 859 NumberOfCodeBlocks, 859 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 784 ConstructedInterpolants, 0 QuantifiedInterpolants, 217978 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...