/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/safe030_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:08:57,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:08:57,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:08:57,180 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:08:57,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:08:57,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:08:57,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:08:57,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:08:57,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:08:57,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:08:57,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:08:57,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:08:57,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:08:57,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:08:57,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:08:57,200 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:08:57,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:08:57,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:08:57,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:08:57,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:08:57,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:08:57,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:08:57,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:08:57,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:08:57,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:08:57,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:08:57,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:08:57,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:08:57,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:08:57,225 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:08:57,225 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:08:57,226 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:08:57,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:08:57,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:08:57,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:08:57,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:08:57,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:08:57,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:08:57,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:08:57,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:08:57,236 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:08:57,237 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:08:57,251 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:08:57,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:08:57,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:08:57,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:08:57,253 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:08:57,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:08:57,253 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:08:57,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:08:57,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:08:57,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:08:57,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:08:57,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:08:57,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:08:57,254 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:08:57,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:08:57,255 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:08:57,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:08:57,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:08:57,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:08:57,256 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:08:57,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:08:57,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:08:57,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:08:57,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:08:57,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:08:57,257 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:08:57,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:08:57,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:08:57,257 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:08:57,257 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:08:57,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:08:57,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:08:57,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:08:57,565 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:08:57,566 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:08:57,567 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2019-12-18 15:08:57,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed29f977/4882200a821042ee927a15cbc7f430ae/FLAG050cdce6b [2019-12-18 15:08:58,220 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:08:58,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2019-12-18 15:08:58,241 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed29f977/4882200a821042ee927a15cbc7f430ae/FLAG050cdce6b [2019-12-18 15:08:58,510 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed29f977/4882200a821042ee927a15cbc7f430ae [2019-12-18 15:08:58,519 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:08:58,521 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:08:58,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:08:58,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:08:58,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:08:58,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:08:58" (1/1) ... [2019-12-18 15:08:58,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79236124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:58, skipping insertion in model container [2019-12-18 15:08:58,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:08:58" (1/1) ... [2019-12-18 15:08:58,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:08:58,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:08:59,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:08:59,133 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:08:59,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:08:59,285 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:08:59,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:59 WrapperNode [2019-12-18 15:08:59,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:08:59,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:08:59,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:08:59,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:08:59,297 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:08:59" (1/1) ... [2019-12-18 15:08:59,322 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:08:59" (1/1) ... [2019-12-18 15:08:59,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:08:59,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:08:59,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:08:59,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:08:59,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:59" (1/1) ... [2019-12-18 15:08:59,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:59" (1/1) ... [2019-12-18 15:08:59,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:59" (1/1) ... [2019-12-18 15:08:59,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:59" (1/1) ... [2019-12-18 15:08:59,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:59" (1/1) ... [2019-12-18 15:08:59,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:59" (1/1) ... [2019-12-18 15:08:59,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:59" (1/1) ... [2019-12-18 15:08:59,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:08:59,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:08:59,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:08:59,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:08:59,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:59" (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:08:59,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:08:59,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 15:08:59,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:08:59,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:08:59,488 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 15:08:59,488 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 15:08:59,488 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 15:08:59,489 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 15:08:59,489 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 15:08:59,489 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 15:08:59,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 15:08:59,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:08:59,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:08:59,492 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:00,211 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:09:00,212 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 15:09:00,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:09:00 BoogieIcfgContainer [2019-12-18 15:09:00,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:09:00,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:09:00,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:09:00,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:09:00,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:08:58" (1/3) ... [2019-12-18 15:09:00,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db9658b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:09:00, skipping insertion in model container [2019-12-18 15:09:00,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:59" (2/3) ... [2019-12-18 15:09:00,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db9658b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:09:00, skipping insertion in model container [2019-12-18 15:09:00,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:09:00" (3/3) ... [2019-12-18 15:09:00,227 INFO L109 eAbstractionObserver]: Analyzing ICFG safe030_power.opt.i [2019-12-18 15:09:00,238 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:09:00,239 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:09:00,252 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 15:09:00,253 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:09:00,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,311 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,311 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,314 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,314 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,327 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,328 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,329 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:00,329 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,330 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,330 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,345 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,345 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:00,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,347 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,347 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,353 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,353 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,355 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,355 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:00,372 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 15:09:00,390 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:09:00,390 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:09:00,390 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:09:00,390 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:09:00,390 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:09:00,390 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:09:00,391 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:09:00,391 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:09:00,425 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 192 transitions [2019-12-18 15:09:00,427 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-18 15:09:00,506 INFO L126 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-18 15:09:00,506 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:09:00,523 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 9/155 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 15:09:00,544 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-18 15:09:00,586 INFO L126 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-18 15:09:00,586 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:09:00,592 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 9/155 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 15:09:00,606 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 15:09:00,607 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:09:05,717 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 15:09:05,823 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 15:09:05,848 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46210 [2019-12-18 15:09:05,848 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-18 15:09:05,852 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 86 transitions [2019-12-18 15:09:06,824 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 15658 states. [2019-12-18 15:09:06,826 INFO L276 IsEmpty]: Start isEmpty. Operand 15658 states. [2019-12-18 15:09:06,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 15:09:06,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:06,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:06,833 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:09:06,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:06,838 INFO L82 PathProgramCache]: Analyzing trace with hash 430910871, now seen corresponding path program 1 times [2019-12-18 15:09:06,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:06,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369039947] [2019-12-18 15:09:06,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:07,152 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:09:07,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369039947] [2019-12-18 15:09:07,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:07,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:09:07,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109601682] [2019-12-18 15:09:07,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:07,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:07,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:07,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:07,179 INFO L87 Difference]: Start difference. First operand 15658 states. Second operand 3 states. [2019-12-18 15:09:07,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:07,628 INFO L93 Difference]: Finished difference Result 15586 states and 57554 transitions. [2019-12-18 15:09:07,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:07,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 15:09:07,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:07,821 INFO L225 Difference]: With dead ends: 15586 [2019-12-18 15:09:07,821 INFO L226 Difference]: Without dead ends: 15248 [2019-12-18 15:09:07,823 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:09:08,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15248 states. [2019-12-18 15:09:09,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15248 to 15248. [2019-12-18 15:09:09,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15248 states. [2019-12-18 15:09:09,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15248 states to 15248 states and 56345 transitions. [2019-12-18 15:09:09,177 INFO L78 Accepts]: Start accepts. Automaton has 15248 states and 56345 transitions. Word has length 7 [2019-12-18 15:09:09,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:09,181 INFO L462 AbstractCegarLoop]: Abstraction has 15248 states and 56345 transitions. [2019-12-18 15:09:09,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 15248 states and 56345 transitions. [2019-12-18 15:09:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:09:09,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:09,192 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:09,192 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:09:09,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:09,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1550259791, now seen corresponding path program 1 times [2019-12-18 15:09:09,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:09,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079903947] [2019-12-18 15:09:09,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:09,311 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:09:09,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079903947] [2019-12-18 15:09:09,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:09,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:09,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685864976] [2019-12-18 15:09:09,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:09:09,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:09,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:09:09,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:09:09,316 INFO L87 Difference]: Start difference. First operand 15248 states and 56345 transitions. Second operand 4 states. [2019-12-18 15:09:09,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:09,919 INFO L93 Difference]: Finished difference Result 24364 states and 86703 transitions. [2019-12-18 15:09:09,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:09:09,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 15:09:09,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:10,018 INFO L225 Difference]: With dead ends: 24364 [2019-12-18 15:09:10,018 INFO L226 Difference]: Without dead ends: 24350 [2019-12-18 15:09:10,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:09:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24350 states. [2019-12-18 15:09:10,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24350 to 21678. [2019-12-18 15:09:10,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21678 states. [2019-12-18 15:09:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21678 states to 21678 states and 78082 transitions. [2019-12-18 15:09:12,231 INFO L78 Accepts]: Start accepts. Automaton has 21678 states and 78082 transitions. Word has length 13 [2019-12-18 15:09:12,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:12,232 INFO L462 AbstractCegarLoop]: Abstraction has 21678 states and 78082 transitions. [2019-12-18 15:09:12,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:09:12,232 INFO L276 IsEmpty]: Start isEmpty. Operand 21678 states and 78082 transitions. [2019-12-18 15:09:12,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:09:12,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:12,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:12,234 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:09:12,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:12,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1785022215, now seen corresponding path program 1 times [2019-12-18 15:09:12,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:12,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970993641] [2019-12-18 15:09:12,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:12,281 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:09:12,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970993641] [2019-12-18 15:09:12,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:12,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:12,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729195909] [2019-12-18 15:09:12,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:12,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:12,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:12,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:12,285 INFO L87 Difference]: Start difference. First operand 21678 states and 78082 transitions. Second operand 3 states. [2019-12-18 15:09:12,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:12,342 INFO L93 Difference]: Finished difference Result 12388 states and 38538 transitions. [2019-12-18 15:09:12,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:12,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 15:09:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:12,398 INFO L225 Difference]: With dead ends: 12388 [2019-12-18 15:09:12,399 INFO L226 Difference]: Without dead ends: 12388 [2019-12-18 15:09:12,399 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:09:12,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12388 states. [2019-12-18 15:09:12,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12388 to 12388. [2019-12-18 15:09:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12388 states. [2019-12-18 15:09:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12388 states to 12388 states and 38538 transitions. [2019-12-18 15:09:12,741 INFO L78 Accepts]: Start accepts. Automaton has 12388 states and 38538 transitions. Word has length 13 [2019-12-18 15:09:12,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:12,742 INFO L462 AbstractCegarLoop]: Abstraction has 12388 states and 38538 transitions. [2019-12-18 15:09:12,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:12,742 INFO L276 IsEmpty]: Start isEmpty. Operand 12388 states and 38538 transitions. [2019-12-18 15:09:12,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 15:09:12,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:12,744 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:12,744 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:09:12,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:12,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1922152669, now seen corresponding path program 1 times [2019-12-18 15:09:12,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:12,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367293677] [2019-12-18 15:09:12,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:12,809 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:09:12,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367293677] [2019-12-18 15:09:12,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:12,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:09:12,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929520380] [2019-12-18 15:09:12,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:09:12,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:12,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:09:12,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:09:12,811 INFO L87 Difference]: Start difference. First operand 12388 states and 38538 transitions. Second operand 4 states. [2019-12-18 15:09:12,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:12,834 INFO L93 Difference]: Finished difference Result 1903 states and 4374 transitions. [2019-12-18 15:09:12,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:09:12,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 15:09:12,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:12,838 INFO L225 Difference]: With dead ends: 1903 [2019-12-18 15:09:12,838 INFO L226 Difference]: Without dead ends: 1903 [2019-12-18 15:09:12,839 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:09:12,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2019-12-18 15:09:12,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1903. [2019-12-18 15:09:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1903 states. [2019-12-18 15:09:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 4374 transitions. [2019-12-18 15:09:12,868 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 4374 transitions. Word has length 14 [2019-12-18 15:09:12,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:12,868 INFO L462 AbstractCegarLoop]: Abstraction has 1903 states and 4374 transitions. [2019-12-18 15:09:12,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:09:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 4374 transitions. [2019-12-18 15:09:12,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 15:09:12,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:12,871 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:09:12,871 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:09:12,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:12,871 INFO L82 PathProgramCache]: Analyzing trace with hash -560054606, now seen corresponding path program 1 times [2019-12-18 15:09:12,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:12,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695273591] [2019-12-18 15:09:12,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:12,928 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:09:12,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695273591] [2019-12-18 15:09:12,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:12,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:09:12,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523417872] [2019-12-18 15:09:12,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:09:12,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:12,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:09:12,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:09:12,931 INFO L87 Difference]: Start difference. First operand 1903 states and 4374 transitions. Second operand 5 states. [2019-12-18 15:09:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:12,964 INFO L93 Difference]: Finished difference Result 669 states and 1571 transitions. [2019-12-18 15:09:12,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:09:12,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 15:09:12,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:12,966 INFO L225 Difference]: With dead ends: 669 [2019-12-18 15:09:12,966 INFO L226 Difference]: Without dead ends: 669 [2019-12-18 15:09:12,967 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:09:12,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-12-18 15:09:12,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 599. [2019-12-18 15:09:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-18 15:09:12,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1406 transitions. [2019-12-18 15:09:12,982 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1406 transitions. Word has length 26 [2019-12-18 15:09:12,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:12,982 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1406 transitions. [2019-12-18 15:09:12,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:09:12,983 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1406 transitions. [2019-12-18 15:09:12,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:09:12,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:12,986 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] [2019-12-18 15:09:12,986 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:09:12,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:12,986 INFO L82 PathProgramCache]: Analyzing trace with hash 958609681, now seen corresponding path program 1 times [2019-12-18 15:09:12,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:12,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061835303] [2019-12-18 15:09:12,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:13,081 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:09:13,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061835303] [2019-12-18 15:09:13,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:13,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:09:13,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832124050] [2019-12-18 15:09:13,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:13,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:13,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:13,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:13,086 INFO L87 Difference]: Start difference. First operand 599 states and 1406 transitions. Second operand 3 states. [2019-12-18 15:09:13,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:13,151 INFO L93 Difference]: Finished difference Result 610 states and 1420 transitions. [2019-12-18 15:09:13,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:13,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 15:09:13,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:13,154 INFO L225 Difference]: With dead ends: 610 [2019-12-18 15:09:13,154 INFO L226 Difference]: Without dead ends: 610 [2019-12-18 15:09:13,155 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:09:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-12-18 15:09:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 605. [2019-12-18 15:09:13,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 15:09:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1415 transitions. [2019-12-18 15:09:13,168 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1415 transitions. Word has length 54 [2019-12-18 15:09:13,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:13,169 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1415 transitions. [2019-12-18 15:09:13,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1415 transitions. [2019-12-18 15:09:13,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:09:13,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:13,175 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] [2019-12-18 15:09:13,176 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:09:13,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:13,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1927722319, now seen corresponding path program 1 times [2019-12-18 15:09:13,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:13,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466145682] [2019-12-18 15:09:13,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:13,415 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:09:13,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466145682] [2019-12-18 15:09:13,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:13,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:09:13,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328480469] [2019-12-18 15:09:13,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:09:13,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:13,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:09:13,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:09:13,422 INFO L87 Difference]: Start difference. First operand 605 states and 1415 transitions. Second operand 5 states. [2019-12-18 15:09:13,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:13,467 INFO L93 Difference]: Finished difference Result 866 states and 1892 transitions. [2019-12-18 15:09:13,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:09:13,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-18 15:09:13,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:13,469 INFO L225 Difference]: With dead ends: 866 [2019-12-18 15:09:13,469 INFO L226 Difference]: Without dead ends: 543 [2019-12-18 15:09:13,469 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:09:13,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-12-18 15:09:13,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2019-12-18 15:09:13,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-12-18 15:09:13,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1235 transitions. [2019-12-18 15:09:13,583 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 1235 transitions. Word has length 54 [2019-12-18 15:09:13,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:13,584 INFO L462 AbstractCegarLoop]: Abstraction has 543 states and 1235 transitions. [2019-12-18 15:09:13,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:09:13,584 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1235 transitions. [2019-12-18 15:09:13,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:09:13,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:13,586 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] [2019-12-18 15:09:13,586 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:09:13,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:13,587 INFO L82 PathProgramCache]: Analyzing trace with hash 906435667, now seen corresponding path program 2 times [2019-12-18 15:09:13,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:13,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152364514] [2019-12-18 15:09:13,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:13,708 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:09:13,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152364514] [2019-12-18 15:09:13,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:13,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:09:13,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401392569] [2019-12-18 15:09:13,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:09:13,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:13,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:09:13,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:09:13,711 INFO L87 Difference]: Start difference. First operand 543 states and 1235 transitions. Second operand 6 states. [2019-12-18 15:09:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:14,056 INFO L93 Difference]: Finished difference Result 896 states and 2053 transitions. [2019-12-18 15:09:14,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 15:09:14,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 15:09:14,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:14,058 INFO L225 Difference]: With dead ends: 896 [2019-12-18 15:09:14,059 INFO L226 Difference]: Without dead ends: 896 [2019-12-18 15:09:14,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:09:14,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2019-12-18 15:09:14,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 701. [2019-12-18 15:09:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-12-18 15:09:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1614 transitions. [2019-12-18 15:09:14,072 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1614 transitions. Word has length 54 [2019-12-18 15:09:14,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:14,073 INFO L462 AbstractCegarLoop]: Abstraction has 701 states and 1614 transitions. [2019-12-18 15:09:14,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:09:14,073 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1614 transitions. [2019-12-18 15:09:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:09:14,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:14,075 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] [2019-12-18 15:09:14,075 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:09:14,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:14,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1177556235, now seen corresponding path program 3 times [2019-12-18 15:09:14,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:14,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976246849] [2019-12-18 15:09:14,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:14,202 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:09:14,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976246849] [2019-12-18 15:09:14,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:14,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:09:14,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115386310] [2019-12-18 15:09:14,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:09:14,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:14,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:09:14,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:09:14,205 INFO L87 Difference]: Start difference. First operand 701 states and 1614 transitions. Second operand 6 states. [2019-12-18 15:09:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:14,570 INFO L93 Difference]: Finished difference Result 1227 states and 2817 transitions. [2019-12-18 15:09:14,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:09:14,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 15:09:14,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:14,573 INFO L225 Difference]: With dead ends: 1227 [2019-12-18 15:09:14,573 INFO L226 Difference]: Without dead ends: 1227 [2019-12-18 15:09:14,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:09:14,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2019-12-18 15:09:14,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 769. [2019-12-18 15:09:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-12-18 15:09:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1782 transitions. [2019-12-18 15:09:14,586 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1782 transitions. Word has length 54 [2019-12-18 15:09:14,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:14,586 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1782 transitions. [2019-12-18 15:09:14,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:09:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1782 transitions. [2019-12-18 15:09:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:09:14,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:14,588 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] [2019-12-18 15:09:14,588 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:09:14,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:14,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1248301937, now seen corresponding path program 4 times [2019-12-18 15:09:14,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:14,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459855279] [2019-12-18 15:09:14,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:14,721 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:09:14,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459855279] [2019-12-18 15:09:14,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:14,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:09:14,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937665932] [2019-12-18 15:09:14,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:09:14,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:14,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:09:14,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:09:14,723 INFO L87 Difference]: Start difference. First operand 769 states and 1782 transitions. Second operand 6 states. [2019-12-18 15:09:14,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:14,796 INFO L93 Difference]: Finished difference Result 1253 states and 2825 transitions. [2019-12-18 15:09:14,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:09:14,796 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 15:09:14,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:14,797 INFO L225 Difference]: With dead ends: 1253 [2019-12-18 15:09:14,797 INFO L226 Difference]: Without dead ends: 423 [2019-12-18 15:09:14,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:09:14,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-12-18 15:09:14,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 371. [2019-12-18 15:09:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-12-18 15:09:14,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 683 transitions. [2019-12-18 15:09:14,803 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 683 transitions. Word has length 54 [2019-12-18 15:09:14,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:14,803 INFO L462 AbstractCegarLoop]: Abstraction has 371 states and 683 transitions. [2019-12-18 15:09:14,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:09:14,804 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 683 transitions. [2019-12-18 15:09:14,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:09:14,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:14,805 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] [2019-12-18 15:09:14,805 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:09:14,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:14,806 INFO L82 PathProgramCache]: Analyzing trace with hash -2138841077, now seen corresponding path program 5 times [2019-12-18 15:09:14,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:14,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013630754] [2019-12-18 15:09:14,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:14,899 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:09:14,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013630754] [2019-12-18 15:09:14,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:14,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:14,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774734264] [2019-12-18 15:09:14,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:14,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:14,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:14,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:14,903 INFO L87 Difference]: Start difference. First operand 371 states and 683 transitions. Second operand 3 states. [2019-12-18 15:09:14,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:14,914 INFO L93 Difference]: Finished difference Result 340 states and 605 transitions. [2019-12-18 15:09:14,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:14,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 15:09:14,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:14,915 INFO L225 Difference]: With dead ends: 340 [2019-12-18 15:09:14,915 INFO L226 Difference]: Without dead ends: 340 [2019-12-18 15:09:14,916 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:09:14,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-12-18 15:09:14,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2019-12-18 15:09:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-18 15:09:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 605 transitions. [2019-12-18 15:09:14,920 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 605 transitions. Word has length 54 [2019-12-18 15:09:14,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:14,921 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 605 transitions. [2019-12-18 15:09:14,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 605 transitions. [2019-12-18 15:09:14,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 15:09:14,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:14,922 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:09:14,922 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:09:14,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:14,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1494390662, now seen corresponding path program 1 times [2019-12-18 15:09:14,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:14,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202261630] [2019-12-18 15:09:14,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:15,035 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:09:15,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202261630] [2019-12-18 15:09:15,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:15,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:15,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999870248] [2019-12-18 15:09:15,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:15,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:15,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:15,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:15,037 INFO L87 Difference]: Start difference. First operand 340 states and 605 transitions. Second operand 3 states. [2019-12-18 15:09:15,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:15,074 INFO L93 Difference]: Finished difference Result 340 states and 604 transitions. [2019-12-18 15:09:15,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:15,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 15:09:15,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:15,076 INFO L225 Difference]: With dead ends: 340 [2019-12-18 15:09:15,076 INFO L226 Difference]: Without dead ends: 340 [2019-12-18 15:09:15,076 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:09:15,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-12-18 15:09:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 220. [2019-12-18 15:09:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-18 15:09:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 387 transitions. [2019-12-18 15:09:15,081 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 387 transitions. Word has length 55 [2019-12-18 15:09:15,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:15,081 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 387 transitions. [2019-12-18 15:09:15,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 387 transitions. [2019-12-18 15:09:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:09:15,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:15,082 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:09:15,082 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:09:15,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:15,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1590264344, now seen corresponding path program 1 times [2019-12-18 15:09:15,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:15,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672523461] [2019-12-18 15:09:15,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:15,378 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:09:15,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672523461] [2019-12-18 15:09:15,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:15,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:09:15,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833252728] [2019-12-18 15:09:15,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:09:15,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:15,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:09:15,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:09:15,381 INFO L87 Difference]: Start difference. First operand 220 states and 387 transitions. Second operand 13 states. [2019-12-18 15:09:16,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:16,051 INFO L93 Difference]: Finished difference Result 384 states and 657 transitions. [2019-12-18 15:09:16,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:09:16,051 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-12-18 15:09:16,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:16,052 INFO L225 Difference]: With dead ends: 384 [2019-12-18 15:09:16,052 INFO L226 Difference]: Without dead ends: 354 [2019-12-18 15:09:16,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:09:16,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-12-18 15:09:16,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 320. [2019-12-18 15:09:16,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-18 15:09:16,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 558 transitions. [2019-12-18 15:09:16,059 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 558 transitions. Word has length 56 [2019-12-18 15:09:16,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:16,059 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 558 transitions. [2019-12-18 15:09:16,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:09:16,059 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 558 transitions. [2019-12-18 15:09:16,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:09:16,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:16,061 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:09:16,061 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:09:16,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:16,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1710889504, now seen corresponding path program 2 times [2019-12-18 15:09:16,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:16,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887008530] [2019-12-18 15:09:16,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:16,792 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:09:16,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887008530] [2019-12-18 15:09:16,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:16,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 15:09:16,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552117772] [2019-12-18 15:09:16,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:09:16,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:16,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:09:16,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:09:16,794 INFO L87 Difference]: Start difference. First operand 320 states and 558 transitions. Second operand 20 states. [2019-12-18 15:09:18,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:18,175 INFO L93 Difference]: Finished difference Result 760 states and 1320 transitions. [2019-12-18 15:09:18,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 15:09:18,176 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-12-18 15:09:18,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:18,177 INFO L225 Difference]: With dead ends: 760 [2019-12-18 15:09:18,177 INFO L226 Difference]: Without dead ends: 730 [2019-12-18 15:09:18,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=253, Invalid=1387, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 15:09:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-12-18 15:09:18,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 348. [2019-12-18 15:09:18,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-18 15:09:18,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 610 transitions. [2019-12-18 15:09:18,188 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 610 transitions. Word has length 56 [2019-12-18 15:09:18,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:18,188 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 610 transitions. [2019-12-18 15:09:18,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:09:18,189 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 610 transitions. [2019-12-18 15:09:18,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:09:18,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:18,193 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:09:18,193 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:09:18,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:18,193 INFO L82 PathProgramCache]: Analyzing trace with hash -552405826, now seen corresponding path program 3 times [2019-12-18 15:09:18,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:18,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772873619] [2019-12-18 15:09:18,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:18,744 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:09:18,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772873619] [2019-12-18 15:09:18,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:18,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:09:18,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723821046] [2019-12-18 15:09:18,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:09:18,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:18,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:09:18,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:09:18,746 INFO L87 Difference]: Start difference. First operand 348 states and 610 transitions. Second operand 14 states. [2019-12-18 15:09:19,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:19,351 INFO L93 Difference]: Finished difference Result 464 states and 790 transitions. [2019-12-18 15:09:19,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:09:19,351 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-18 15:09:19,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:19,352 INFO L225 Difference]: With dead ends: 464 [2019-12-18 15:09:19,352 INFO L226 Difference]: Without dead ends: 434 [2019-12-18 15:09:19,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-12-18 15:09:19,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-12-18 15:09:19,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 328. [2019-12-18 15:09:19,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-18 15:09:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 572 transitions. [2019-12-18 15:09:19,359 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 572 transitions. Word has length 56 [2019-12-18 15:09:19,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:19,359 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 572 transitions. [2019-12-18 15:09:19,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:09:19,359 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 572 transitions. [2019-12-18 15:09:19,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:09:19,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:19,361 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:09:19,361 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:09:19,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:19,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1475134232, now seen corresponding path program 4 times [2019-12-18 15:09:19,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:19,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314164051] [2019-12-18 15:09:19,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:09:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:09:19,457 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:09:19,457 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:09:19,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] ULTIMATE.startENTRY-->L798: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd1~0_54) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2492~0.base_27|) (= 0 v_~y$r_buff1_thd3~0_115) (= 0 v_~y$r_buff1_thd2~0_106) (= v_~weak$$choice2~0_112 0) (= v_~y$r_buff0_thd1~0_53 0) (= v_~y$r_buff0_thd0~0_348 0) (= v_~y$w_buff0_used~0_737 0) (= v_~y$w_buff1~0_230 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff0_thd3~0_169) (= 0 v_~y$w_buff0~0_338) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_108) (= (store .cse0 |v_ULTIMATE.start_main_~#t2492~0.base_27| 1) |v_#valid_59|) (= v_~y$mem_tmp~0_19 0) (= v_~z~0_90 0) (= v_~x~0_77 0) (= v_~y$w_buff1_used~0_407 0) (= v_~main$tmp_guard0~0_21 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2492~0.base_27|)) (= 0 v_~__unbuffered_cnt~0_90) (= v_~y$r_buff1_thd0~0_237 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2492~0.base_27| 4) |v_#length_25|) (= 0 |v_ULTIMATE.start_main_~#t2492~0.offset_20|) (= 0 v_~y$flush_delayed~0_38) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y~0_150 0) (= 0 |v_#NULL.base_5|) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2492~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2492~0.base_27|) |v_ULTIMATE.start_main_~#t2492~0.offset_20| 0))) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_34|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_39|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_62|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_31|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_71|, ULTIMATE.start_main_~#t2494~0.base=|v_ULTIMATE.start_main_~#t2494~0.base_20|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_19, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_115, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_25|, ULTIMATE.start_main_~#t2494~0.offset=|v_ULTIMATE.start_main_~#t2494~0.offset_16|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_118|, ULTIMATE.start_main_~#t2493~0.offset=|v_ULTIMATE.start_main_~#t2493~0.offset_17|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_45|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_34|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_37|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_40|, ~y$w_buff1~0=v_~y$w_buff1~0_230, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ULTIMATE.start_main_~#t2492~0.offset=|v_ULTIMATE.start_main_~#t2492~0.offset_20|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_237, ~x~0=v_~x~0_77, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_737, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_45|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_37|, ULTIMATE.start_main_~#t2493~0.base=|v_ULTIMATE.start_main_~#t2493~0.base_20|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_43|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_24|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_31|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_62|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_54, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~y$w_buff0~0=v_~y$w_buff0~0_338, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_169, ~y~0=v_~y~0_150, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_37|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_206|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_~#t2492~0.base=|v_ULTIMATE.start_main_~#t2492~0.base_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_114|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_42|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} 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, ULTIMATE.start_main_~#t2494~0.base, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t2494~0.offset, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t2493~0.offset, 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_~#t2492~0.offset, 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_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_~#t2493~0.base, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~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, ULTIMATE.start_main_~#t2492~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 15:09:19,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L798-1-->L800: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2493~0.base_9| 4)) (= |v_ULTIMATE.start_main_~#t2493~0.offset_9| 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2493~0.base_9| 1)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2493~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2493~0.base_9|) |v_ULTIMATE.start_main_~#t2493~0.offset_9| 1))) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2493~0.base_9|)) (not (= |v_ULTIMATE.start_main_~#t2493~0.base_9| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2493~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2493~0.offset=|v_ULTIMATE.start_main_~#t2493~0.offset_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2493~0.base=|v_ULTIMATE.start_main_~#t2493~0.base_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2493~0.offset, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2493~0.base] because there is no mapped edge [2019-12-18 15:09:19,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L800-1-->L802: Formula: (and (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2494~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2494~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2494~0.base_10|) |v_ULTIMATE.start_main_~#t2494~0.offset_9| 2)) |v_#memory_int_11|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2494~0.base_10| 1) |v_#valid_31|) (not (= 0 |v_ULTIMATE.start_main_~#t2494~0.base_10|)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2494~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2494~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t2494~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2494~0.base=|v_ULTIMATE.start_main_~#t2494~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2494~0.offset=|v_ULTIMATE.start_main_~#t2494~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2494~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t2494~0.offset] because there is no mapped edge [2019-12-18 15:09:19,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P2ENTRY-->L4-3: Formula: (and (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out592389781 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out592389781|) (= (mod ~y$w_buff1_used~0_Out592389781 256) 0) (= ~y$w_buff0~0_Out592389781 2) (= ~y$w_buff1~0_Out592389781 ~y$w_buff0~0_In592389781) (= P2Thread1of1ForFork0_~arg.offset_Out592389781 |P2Thread1of1ForFork0_#in~arg.offset_In592389781|) (= ~y$w_buff0_used~0_In592389781 ~y$w_buff1_used~0_Out592389781) (= 1 ~y$w_buff0_used~0_Out592389781) (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out592389781| 1) (= |P2Thread1of1ForFork0_#in~arg.base_In592389781| P2Thread1of1ForFork0_~arg.base_Out592389781)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In592389781|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In592389781, ~y$w_buff0~0=~y$w_buff0~0_In592389781, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In592389781|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out592389781, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out592389781|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In592389781|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out592389781, ~y$w_buff1~0=~y$w_buff1~0_Out592389781, ~y$w_buff0~0=~y$w_buff0~0_Out592389781, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out592389781, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In592389781|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out592389781, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out592389781} 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:09:19,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_60 1) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_~z~0_51 2) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~z~0=v_~z~0_51, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_60, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 15:09:19,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1945578554 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1945578554 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite11_Out1945578554|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1945578554 |P2Thread1of1ForFork0_#t~ite11_Out1945578554|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1945578554, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1945578554} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1945578554, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out1945578554|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1945578554} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 15:09:19,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L746-2-->L746-5: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-372671410 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-372671410 256))) (.cse1 (= |P1Thread1of1ForFork2_#t~ite3_Out-372671410| |P1Thread1of1ForFork2_#t~ite4_Out-372671410|))) (or (and (not .cse0) .cse1 (= |P1Thread1of1ForFork2_#t~ite3_Out-372671410| ~y$w_buff1~0_In-372671410) (not .cse2)) (and (or .cse2 .cse0) (= |P1Thread1of1ForFork2_#t~ite3_Out-372671410| ~y~0_In-372671410) .cse1))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-372671410, ~y$w_buff1~0=~y$w_buff1~0_In-372671410, ~y~0=~y~0_In-372671410, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-372671410} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-372671410, ~y$w_buff1~0=~y$w_buff1~0_In-372671410, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out-372671410|, ~y~0=~y~0_In-372671410, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-372671410|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-372671410} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 15:09:19,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L777-->L777-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1302405692 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1302405692 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1302405692 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1302405692 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite12_Out1302405692| ~y$w_buff1_used~0_In1302405692)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite12_Out1302405692| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1302405692, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1302405692, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1302405692, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1302405692} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1302405692, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1302405692, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1302405692|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1302405692, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1302405692} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 15:09:19,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-501949699 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-501949699 256)))) (or (and (= ~y$w_buff0_used~0_In-501949699 |P1Thread1of1ForFork2_#t~ite5_Out-501949699|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite5_Out-501949699|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-501949699, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-501949699} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-501949699, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-501949699, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-501949699|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 15:09:19,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-786693948 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-786693948 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-786693948 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-786693948 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite6_Out-786693948|)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-786693948 |P1Thread1of1ForFork2_#t~ite6_Out-786693948|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-786693948, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-786693948, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-786693948, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-786693948} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-786693948, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-786693948, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-786693948, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-786693948|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-786693948} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 15:09:19,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1386119963 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1386119963 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In-1386119963 |P1Thread1of1ForFork2_#t~ite7_Out-1386119963|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite7_Out-1386119963| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1386119963, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1386119963} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1386119963, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1386119963, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-1386119963|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 15:09:19,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In41071739 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In41071739 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In41071739 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In41071739 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite8_Out41071739| 0)) (and (= |P1Thread1of1ForFork2_#t~ite8_Out41071739| ~y$r_buff1_thd2~0_In41071739) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In41071739, ~y$w_buff0_used~0=~y$w_buff0_used~0_In41071739, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In41071739, ~y$w_buff1_used~0=~y$w_buff1_used~0_In41071739} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In41071739, ~y$w_buff0_used~0=~y$w_buff0_used~0_In41071739, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out41071739|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In41071739, ~y$w_buff1_used~0=~y$w_buff1_used~0_In41071739} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 15:09:19,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L750-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_36| v_~y$r_buff1_thd2~0_71) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_71, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, 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:09:19,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L778-->L779: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-513091174 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-513091174 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out-513091174 ~y$r_buff0_thd3~0_In-513091174)) (and (= ~y$r_buff0_thd3~0_Out-513091174 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-513091174, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-513091174} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-513091174, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-513091174, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-513091174|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 15:09:19,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1398165102 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1398165102 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1398165102 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1398165102 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite14_Out1398165102| ~y$r_buff1_thd3~0_In1398165102)) (and (= 0 |P2Thread1of1ForFork0_#t~ite14_Out1398165102|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1398165102, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1398165102, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1398165102, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1398165102} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1398165102|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1398165102, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1398165102, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1398165102, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1398165102} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 15:09:19,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L779-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_34| v_~y$r_buff1_thd3~0_66)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_33|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_66, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, 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:09:19,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~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:09:19,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L808-2-->L808-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite19_Out-1062825420| |ULTIMATE.start_main_#t~ite18_Out-1062825420|)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1062825420 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1062825420 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite18_Out-1062825420| ~y$w_buff1~0_In-1062825420) (not .cse1) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite18_Out-1062825420| ~y~0_In-1062825420) (or .cse2 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1062825420, ~y~0=~y~0_In-1062825420, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1062825420, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1062825420} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1062825420, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1062825420|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1062825420|, ~y~0=~y~0_In-1062825420, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1062825420, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1062825420} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 15:09:19,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-298557513 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-298557513 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite20_Out-298557513| 0)) (and (= |ULTIMATE.start_main_#t~ite20_Out-298557513| ~y$w_buff0_used~0_In-298557513) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-298557513, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-298557513} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-298557513, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-298557513, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-298557513|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 15:09:19,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In897711047 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In897711047 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In897711047 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In897711047 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out897711047| ~y$w_buff1_used~0_In897711047) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite21_Out897711047|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In897711047, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In897711047, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In897711047, ~y$w_buff1_used~0=~y$w_buff1_used~0_In897711047} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In897711047, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In897711047, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out897711047|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In897711047, ~y$w_buff1_used~0=~y$w_buff1_used~0_In897711047} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 15:09:19,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1145159288 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1145159288 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1145159288 |ULTIMATE.start_main_#t~ite22_Out-1145159288|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite22_Out-1145159288|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1145159288, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1145159288} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1145159288, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1145159288, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1145159288|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 15:09:19,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In780581770 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In780581770 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In780581770 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In780581770 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite23_Out780581770|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In780581770 |ULTIMATE.start_main_#t~ite23_Out780581770|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In780581770, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In780581770, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In780581770, ~y$w_buff1_used~0=~y$w_buff1_used~0_In780581770} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In780581770, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In780581770, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In780581770, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out780581770|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In780581770} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 15:09:19,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L820-->L820-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1401344321 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite29_Out-1401344321| |ULTIMATE.start_main_#t~ite30_Out-1401344321|) (= |ULTIMATE.start_main_#t~ite29_Out-1401344321| ~y$w_buff0~0_In-1401344321) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1401344321 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1401344321 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-1401344321 256)) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-1401344321 256) 0))))) (and (= |ULTIMATE.start_main_#t~ite29_In-1401344321| |ULTIMATE.start_main_#t~ite29_Out-1401344321|) (= |ULTIMATE.start_main_#t~ite30_Out-1401344321| ~y$w_buff0~0_In-1401344321) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1401344321, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-1401344321|, ~y$w_buff0~0=~y$w_buff0~0_In-1401344321, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1401344321, ~weak$$choice2~0=~weak$$choice2~0_In-1401344321, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1401344321, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1401344321} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1401344321|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1401344321, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1401344321|, ~y$w_buff0~0=~y$w_buff0~0_In-1401344321, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1401344321, ~weak$$choice2~0=~weak$$choice2~0_In-1401344321, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1401344321, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1401344321} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 15:09:19,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L821-->L821-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In332226658 256)))) (or (and (= ~y$w_buff1~0_In332226658 |ULTIMATE.start_main_#t~ite33_Out332226658|) (= |ULTIMATE.start_main_#t~ite32_In332226658| |ULTIMATE.start_main_#t~ite32_Out332226658|) (not .cse0)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In332226658 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In332226658 256))) (= 0 (mod ~y$w_buff0_used~0_In332226658 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In332226658 256) 0)))) (= ~y$w_buff1~0_In332226658 |ULTIMATE.start_main_#t~ite32_Out332226658|) (= |ULTIMATE.start_main_#t~ite33_Out332226658| |ULTIMATE.start_main_#t~ite32_Out332226658|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In332226658, ~y$w_buff0_used~0=~y$w_buff0_used~0_In332226658, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In332226658, ~weak$$choice2~0=~weak$$choice2~0_In332226658, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In332226658, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In332226658|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In332226658} OutVars{~y$w_buff1~0=~y$w_buff1~0_In332226658, ~y$w_buff0_used~0=~y$w_buff0_used~0_In332226658, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In332226658, ~weak$$choice2~0=~weak$$choice2~0_In332226658, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out332226658|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In332226658, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out332226658|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In332226658} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-18 15:09:19,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1221727600 256)))) (or (and (= |ULTIMATE.start_main_#t~ite35_In1221727600| |ULTIMATE.start_main_#t~ite35_Out1221727600|) (= |ULTIMATE.start_main_#t~ite36_Out1221727600| ~y$w_buff0_used~0_In1221727600) (not .cse0)) (and .cse0 (= |ULTIMATE.start_main_#t~ite35_Out1221727600| ~y$w_buff0_used~0_In1221727600) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1221727600 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1221727600 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In1221727600 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1221727600 256))))) (= |ULTIMATE.start_main_#t~ite35_Out1221727600| |ULTIMATE.start_main_#t~ite36_Out1221727600|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1221727600, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1221727600, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In1221727600|, ~weak$$choice2~0=~weak$$choice2~0_In1221727600, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1221727600, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1221727600} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1221727600, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1221727600, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1221727600|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1221727600|, ~weak$$choice2~0=~weak$$choice2~0_In1221727600, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1221727600, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1221727600} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 15:09:19,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L824-->L825-8: Formula: (and (= v_~y$r_buff1_thd0~0_226 |v_ULTIMATE.start_main_#t~ite45_60|) (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= |v_ULTIMATE.start_main_#t~ite43_49| |v_ULTIMATE.start_main_#t~ite43_48|) (= |v_ULTIMATE.start_main_#t~ite44_49| |v_ULTIMATE.start_main_#t~ite44_48|) (= v_~y$r_buff0_thd0~0_339 v_~y$r_buff0_thd0~0_338)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_339, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_49|, ~weak$$choice2~0=v_~weak$$choice2~0_105, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_49|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_338, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ~weak$$choice2~0=v_~weak$$choice2~0_105, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_19|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_48|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 15:09:19,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L827-->L830-1: Formula: (and (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_~y~0_89 v_~y$mem_tmp~0_11) (= 0 v_~y$flush_delayed~0_23) (not (= (mod v_~y$flush_delayed~0_24 256) 0))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_23, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~y~0=v_~y~0_89, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~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:09:19,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L830-1-->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:09:19,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:09:19 BasicIcfg [2019-12-18 15:09:19,569 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:09:19,571 INFO L168 Benchmark]: Toolchain (without parser) took 21050.23 ms. Allocated memory was 144.2 MB in the beginning and 847.2 MB in the end (delta: 703.1 MB). Free memory was 100.3 MB in the beginning and 473.6 MB in the end (delta: -373.3 MB). Peak memory consumption was 329.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:19,571 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 144.2 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 15:09:19,572 INFO L168 Benchmark]: CACSL2BoogieTranslator took 765.56 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 99.9 MB in the beginning and 154.3 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:19,573 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.56 ms. Allocated memory is still 200.8 MB. Free memory was 154.3 MB in the beginning and 151.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:19,573 INFO L168 Benchmark]: Boogie Preprocessor took 48.32 ms. Allocated memory is still 200.8 MB. Free memory was 151.4 MB in the beginning and 149.5 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:09:19,574 INFO L168 Benchmark]: RCFGBuilder took 795.17 ms. Allocated memory is still 200.8 MB. Free memory was 149.5 MB in the beginning and 102.7 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:19,575 INFO L168 Benchmark]: TraceAbstraction took 19353.00 ms. Allocated memory was 200.8 MB in the beginning and 847.2 MB in the end (delta: 646.4 MB). Free memory was 102.7 MB in the beginning and 473.6 MB in the end (delta: -370.9 MB). Peak memory consumption was 275.5 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:19,578 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.47 ms. Allocated memory is still 144.2 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 765.56 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 99.9 MB in the beginning and 154.3 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.56 ms. Allocated memory is still 200.8 MB. Free memory was 154.3 MB in the beginning and 151.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.32 ms. Allocated memory is still 200.8 MB. Free memory was 151.4 MB in the beginning and 149.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 795.17 ms. Allocated memory is still 200.8 MB. Free memory was 149.5 MB in the beginning and 102.7 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19353.00 ms. Allocated memory was 200.8 MB in the beginning and 847.2 MB in the end (delta: 646.4 MB). Free memory was 102.7 MB in the beginning and 473.6 MB in the end (delta: -370.9 MB). Peak memory consumption was 275.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 161 ProgramPointsBefore, 81 ProgramPointsAfterwards, 192 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 4050 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 227 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 46210 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L798] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L800] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L802] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L765] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L769] 3 y$r_buff0_thd3 = (_Bool)1 [L772] 3 z = 1 VAL [__unbuffered_cnt=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] [L775] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, 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] [L740] 2 x = 2 [L743] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, 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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L775] 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) [L746] 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, 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=2, 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] [L776] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L746] 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) [L777] 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 [L747] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L748] 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 [L749] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 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, 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=2, 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] [L808] 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) [L809] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L810] 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 [L811] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L812] 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 [L815] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 0 y$flush_delayed = weak$$choice2 [L818] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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=2, 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] [L819] 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, 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=2, 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] [L819] 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) [L820] 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)) [L821] 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)) [L822] 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)) [L823] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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=2, 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$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)) [L825] 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)) [L826] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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=2, 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, 152 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1409 SDtfs, 1520 SDslu, 3714 SDs, 0 SdLazy, 2400 SolverSat, 160 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 23 SyntacticMatches, 13 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21678occurred 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.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 4094 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 676 NumberOfCodeBlocks, 676 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 605 ConstructedInterpolants, 0 QuantifiedInterpolants, 135668 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...