/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:49:36,221 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:49:36,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:49:36,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:49:36,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:49:36,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:49:36,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:49:36,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:49:36,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:49:36,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:49:36,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:49:36,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:49:36,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:49:36,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:49:36,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:49:36,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:49:36,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:49:36,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:49:36,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:49:36,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:49:36,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:49:36,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:49:36,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:49:36,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:49:36,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:49:36,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:49:36,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:49:36,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:49:36,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:49:36,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:49:36,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:49:36,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:49:36,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:49:36,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:49:36,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:49:36,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:49:36,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:49:36,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:49:36,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:49:36,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:49:36,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:49:36,313 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:49:36,332 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:49:36,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:49:36,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:49:36,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:49:36,334 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:49:36,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:49:36,334 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:49:36,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:49:36,335 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:49:36,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:49:36,336 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:49:36,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:49:36,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:49:36,337 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:49:36,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:49:36,337 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:49:36,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:49:36,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:49:36,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:49:36,338 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:49:36,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:49:36,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:49:36,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:49:36,339 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:49:36,339 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:49:36,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:49:36,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:49:36,340 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:49:36,340 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:49:36,340 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:49:36,603 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:49:36,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:49:36,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:49:36,625 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:49:36,625 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:49:36,626 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_pso.opt.i [2019-12-18 21:49:36,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28cb3da49/698dcebad425495db24d76c43de97b4a/FLAG57a817634 [2019-12-18 21:49:37,290 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:49:37,290 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_pso.opt.i [2019-12-18 21:49:37,311 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28cb3da49/698dcebad425495db24d76c43de97b4a/FLAG57a817634 [2019-12-18 21:49:37,611 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28cb3da49/698dcebad425495db24d76c43de97b4a [2019-12-18 21:49:37,622 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:49:37,623 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:49:37,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:49:37,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:49:37,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:49:37,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:49:37" (1/1) ... [2019-12-18 21:49:37,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2075a967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:37, skipping insertion in model container [2019-12-18 21:49:37,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:49:37" (1/1) ... [2019-12-18 21:49:37,640 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:49:37,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:49:38,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:49:38,297 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:49:38,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:49:38,452 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:49:38,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:38 WrapperNode [2019-12-18 21:49:38,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:49:38,453 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:49:38,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:49:38,454 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:49:38,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:38" (1/1) ... [2019-12-18 21:49:38,485 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:38" (1/1) ... [2019-12-18 21:49:38,522 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:49:38,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:49:38,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:49:38,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:49:38,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:38" (1/1) ... [2019-12-18 21:49:38,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:38" (1/1) ... [2019-12-18 21:49:38,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:38" (1/1) ... [2019-12-18 21:49:38,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:38" (1/1) ... [2019-12-18 21:49:38,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:38" (1/1) ... [2019-12-18 21:49:38,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:38" (1/1) ... [2019-12-18 21:49:38,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:38" (1/1) ... [2019-12-18 21:49:38,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:49:38,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:49:38,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:49:38,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:49:38,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:38" (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 21:49:38,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:49:38,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:49:38,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:49:38,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:49:38,624 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:49:38,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:49:38,625 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:49:38,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:49:38,625 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:49:38,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:49:38,626 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:49:38,626 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:49:38,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:49:38,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:49:38,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:49:38,628 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 21:49:39,381 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:49:39,382 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:49:39,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:49:39 BoogieIcfgContainer [2019-12-18 21:49:39,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:49:39,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:49:39,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:49:39,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:49:39,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:49:37" (1/3) ... [2019-12-18 21:49:39,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228ba0a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:49:39, skipping insertion in model container [2019-12-18 21:49:39,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:38" (2/3) ... [2019-12-18 21:49:39,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228ba0a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:49:39, skipping insertion in model container [2019-12-18 21:49:39,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:49:39" (3/3) ... [2019-12-18 21:49:39,392 INFO L109 eAbstractionObserver]: Analyzing ICFG mix055_pso.opt.i [2019-12-18 21:49:39,402 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:49:39,402 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:49:39,409 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:49:39,410 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:49:39,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,448 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,449 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,451 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,451 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,452 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,453 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,460 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,460 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,460 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,461 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,476 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,476 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,477 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,478 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,478 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,478 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,478 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,479 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,479 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,479 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,479 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,480 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,480 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,480 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,480 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,480 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,480 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,481 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,481 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,481 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,481 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,482 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,482 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,482 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,482 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,482 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,483 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,483 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,483 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,483 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,487 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,487 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,490 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,490 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,495 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,495 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,498 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,498 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,498 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,499 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,499 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,499 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,499 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,499 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,500 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,500 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,500 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,500 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:39,513 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:49:39,529 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:49:39,529 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:49:39,529 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:49:39,529 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:49:39,530 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:49:39,530 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:49:39,530 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:49:39,530 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:49:39,548 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 207 transitions [2019-12-18 21:49:39,550 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-18 21:49:39,633 INFO L126 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-18 21:49:39,634 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:49:39,649 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/172 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:49:39,669 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-18 21:49:39,739 INFO L126 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-18 21:49:39,739 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:49:39,748 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/172 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:49:39,766 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 21:49:39,767 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:49:43,234 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 21:49:43,369 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 21:49:43,400 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51526 [2019-12-18 21:49:43,400 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 21:49:43,403 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 96 transitions [2019-12-18 21:49:45,591 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34622 states. [2019-12-18 21:49:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 34622 states. [2019-12-18 21:49:45,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:49:45,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:45,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:45,600 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:45,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:45,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1005539762, now seen corresponding path program 1 times [2019-12-18 21:49:45,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:45,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974736464] [2019-12-18 21:49:45,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:45,927 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 21:49:45,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974736464] [2019-12-18 21:49:45,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:45,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:49:45,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557394549] [2019-12-18 21:49:45,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:49:45,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:45,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:49:45,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:45,955 INFO L87 Difference]: Start difference. First operand 34622 states. Second operand 3 states. [2019-12-18 21:49:46,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:46,632 INFO L93 Difference]: Finished difference Result 34366 states and 145048 transitions. [2019-12-18 21:49:46,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:49:46,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:49:46,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:48,040 INFO L225 Difference]: With dead ends: 34366 [2019-12-18 21:49:48,040 INFO L226 Difference]: Without dead ends: 33694 [2019-12-18 21:49:48,041 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 21:49:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33694 states. [2019-12-18 21:49:49,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33694 to 33694. [2019-12-18 21:49:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33694 states. [2019-12-18 21:49:51,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33694 states to 33694 states and 142304 transitions. [2019-12-18 21:49:51,103 INFO L78 Accepts]: Start accepts. Automaton has 33694 states and 142304 transitions. Word has length 9 [2019-12-18 21:49:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:51,104 INFO L462 AbstractCegarLoop]: Abstraction has 33694 states and 142304 transitions. [2019-12-18 21:49:51,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:49:51,105 INFO L276 IsEmpty]: Start isEmpty. Operand 33694 states and 142304 transitions. [2019-12-18 21:49:51,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:49:51,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:51,116 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:51,116 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:51,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:51,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1499462081, now seen corresponding path program 1 times [2019-12-18 21:49:51,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:51,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664472288] [2019-12-18 21:49:51,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:51,252 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 21:49:51,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664472288] [2019-12-18 21:49:51,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:51,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:49:51,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481271496] [2019-12-18 21:49:51,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:49:51,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:51,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:49:51,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:49:51,256 INFO L87 Difference]: Start difference. First operand 33694 states and 142304 transitions. Second operand 4 states. [2019-12-18 21:49:51,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:51,875 INFO L93 Difference]: Finished difference Result 52350 states and 214000 transitions. [2019-12-18 21:49:51,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:49:51,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:49:51,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:52,526 INFO L225 Difference]: With dead ends: 52350 [2019-12-18 21:49:52,527 INFO L226 Difference]: Without dead ends: 52322 [2019-12-18 21:49:52,527 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 21:49:52,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-18 21:49:54,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 46842. [2019-12-18 21:49:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46842 states. [2019-12-18 21:49:54,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46842 states to 46842 states and 193636 transitions. [2019-12-18 21:49:54,582 INFO L78 Accepts]: Start accepts. Automaton has 46842 states and 193636 transitions. Word has length 15 [2019-12-18 21:49:54,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:54,582 INFO L462 AbstractCegarLoop]: Abstraction has 46842 states and 193636 transitions. [2019-12-18 21:49:54,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:49:54,582 INFO L276 IsEmpty]: Start isEmpty. Operand 46842 states and 193636 transitions. [2019-12-18 21:49:54,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:49:54,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:54,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:54,586 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:54,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:54,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1997976486, now seen corresponding path program 1 times [2019-12-18 21:49:54,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:54,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219405392] [2019-12-18 21:49:54,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:54,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219405392] [2019-12-18 21:49:54,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:54,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:49:54,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876426855] [2019-12-18 21:49:54,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:49:54,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:54,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:49:54,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:49:54,684 INFO L87 Difference]: Start difference. First operand 46842 states and 193636 transitions. Second operand 4 states. [2019-12-18 21:49:56,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:56,724 INFO L93 Difference]: Finished difference Result 57862 states and 237476 transitions. [2019-12-18 21:49:56,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:49:56,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:49:56,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:56,954 INFO L225 Difference]: With dead ends: 57862 [2019-12-18 21:49:56,954 INFO L226 Difference]: Without dead ends: 57862 [2019-12-18 21:49:56,955 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 21:49:57,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57862 states. [2019-12-18 21:50:00,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57862 to 51558. [2019-12-18 21:50:00,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51558 states. [2019-12-18 21:50:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51558 states to 51558 states and 212860 transitions. [2019-12-18 21:50:00,602 INFO L78 Accepts]: Start accepts. Automaton has 51558 states and 212860 transitions. Word has length 15 [2019-12-18 21:50:00,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:00,602 INFO L462 AbstractCegarLoop]: Abstraction has 51558 states and 212860 transitions. [2019-12-18 21:50:00,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:50:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 51558 states and 212860 transitions. [2019-12-18 21:50:00,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 21:50:00,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:00,618 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] [2019-12-18 21:50:00,618 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:50:00,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:00,619 INFO L82 PathProgramCache]: Analyzing trace with hash 188440407, now seen corresponding path program 1 times [2019-12-18 21:50:00,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:00,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445197635] [2019-12-18 21:50:00,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:00,710 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 21:50:00,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445197635] [2019-12-18 21:50:00,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:00,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:50:00,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602296791] [2019-12-18 21:50:00,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:50:00,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:00,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:50:00,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:50:00,712 INFO L87 Difference]: Start difference. First operand 51558 states and 212860 transitions. Second operand 4 states. [2019-12-18 21:50:00,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:00,906 INFO L93 Difference]: Finished difference Result 41440 states and 157219 transitions. [2019-12-18 21:50:00,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:50:00,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-18 21:50:00,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:01,011 INFO L225 Difference]: With dead ends: 41440 [2019-12-18 21:50:01,011 INFO L226 Difference]: Without dead ends: 40332 [2019-12-18 21:50:01,012 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 21:50:01,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40332 states. [2019-12-18 21:50:02,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40332 to 40332. [2019-12-18 21:50:02,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40332 states. [2019-12-18 21:50:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40332 states to 40332 states and 153743 transitions. [2019-12-18 21:50:02,275 INFO L78 Accepts]: Start accepts. Automaton has 40332 states and 153743 transitions. Word has length 21 [2019-12-18 21:50:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:02,275 INFO L462 AbstractCegarLoop]: Abstraction has 40332 states and 153743 transitions. [2019-12-18 21:50:02,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:50:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 40332 states and 153743 transitions. [2019-12-18 21:50:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:50:02,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:02,289 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] [2019-12-18 21:50:02,289 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:50:02,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:02,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1960384026, now seen corresponding path program 1 times [2019-12-18 21:50:02,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:02,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612294428] [2019-12-18 21:50:02,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:02,372 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 21:50:02,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612294428] [2019-12-18 21:50:02,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:02,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:50:02,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876880376] [2019-12-18 21:50:02,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:50:02,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:02,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:50:02,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:50:02,374 INFO L87 Difference]: Start difference. First operand 40332 states and 153743 transitions. Second operand 5 states. [2019-12-18 21:50:03,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:03,477 INFO L93 Difference]: Finished difference Result 53868 states and 201666 transitions. [2019-12-18 21:50:03,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:50:03,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 21:50:03,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:03,600 INFO L225 Difference]: With dead ends: 53868 [2019-12-18 21:50:03,600 INFO L226 Difference]: Without dead ends: 53847 [2019-12-18 21:50:03,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:50:03,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53847 states. [2019-12-18 21:50:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53847 to 40578. [2019-12-18 21:50:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40578 states. [2019-12-18 21:50:06,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40578 states to 40578 states and 154375 transitions. [2019-12-18 21:50:06,547 INFO L78 Accepts]: Start accepts. Automaton has 40578 states and 154375 transitions. Word has length 22 [2019-12-18 21:50:06,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:06,547 INFO L462 AbstractCegarLoop]: Abstraction has 40578 states and 154375 transitions. [2019-12-18 21:50:06,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:50:06,547 INFO L276 IsEmpty]: Start isEmpty. Operand 40578 states and 154375 transitions. [2019-12-18 21:50:06,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 21:50:06,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:06,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:50:06,584 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:50:06,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:06,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1903836691, now seen corresponding path program 1 times [2019-12-18 21:50:06,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:06,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630343255] [2019-12-18 21:50:06,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:06,636 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 21:50:06,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630343255] [2019-12-18 21:50:06,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:06,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:50:06,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327468659] [2019-12-18 21:50:06,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:50:06,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:06,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:50:06,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:50:06,638 INFO L87 Difference]: Start difference. First operand 40578 states and 154375 transitions. Second operand 3 states. [2019-12-18 21:50:06,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:06,934 INFO L93 Difference]: Finished difference Result 51158 states and 192741 transitions. [2019-12-18 21:50:06,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:50:06,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-18 21:50:06,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:07,048 INFO L225 Difference]: With dead ends: 51158 [2019-12-18 21:50:07,049 INFO L226 Difference]: Without dead ends: 51158 [2019-12-18 21:50:07,049 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 21:50:07,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51158 states. [2019-12-18 21:50:08,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51158 to 44232. [2019-12-18 21:50:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44232 states. [2019-12-18 21:50:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44232 states to 44232 states and 167871 transitions. [2019-12-18 21:50:08,299 INFO L78 Accepts]: Start accepts. Automaton has 44232 states and 167871 transitions. Word has length 30 [2019-12-18 21:50:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:08,299 INFO L462 AbstractCegarLoop]: Abstraction has 44232 states and 167871 transitions. [2019-12-18 21:50:08,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:50:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 44232 states and 167871 transitions. [2019-12-18 21:50:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 21:50:08,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:08,328 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] [2019-12-18 21:50:08,328 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:50:08,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:08,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1904073376, now seen corresponding path program 1 times [2019-12-18 21:50:08,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:08,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324334969] [2019-12-18 21:50:08,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:08,408 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 21:50:08,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324334969] [2019-12-18 21:50:08,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:08,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:50:08,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910523463] [2019-12-18 21:50:08,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:50:08,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:08,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:50:08,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:50:08,410 INFO L87 Difference]: Start difference. First operand 44232 states and 167871 transitions. Second operand 5 states. [2019-12-18 21:50:08,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:08,525 INFO L93 Difference]: Finished difference Result 19345 states and 60752 transitions. [2019-12-18 21:50:08,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:50:08,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 21:50:08,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:08,552 INFO L225 Difference]: With dead ends: 19345 [2019-12-18 21:50:08,552 INFO L226 Difference]: Without dead ends: 18469 [2019-12-18 21:50:08,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:50:08,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18469 states. [2019-12-18 21:50:09,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18469 to 18469. [2019-12-18 21:50:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18469 states. [2019-12-18 21:50:09,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18469 states to 18469 states and 57954 transitions. [2019-12-18 21:50:09,231 INFO L78 Accepts]: Start accepts. Automaton has 18469 states and 57954 transitions. Word has length 30 [2019-12-18 21:50:09,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:09,231 INFO L462 AbstractCegarLoop]: Abstraction has 18469 states and 57954 transitions. [2019-12-18 21:50:09,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:50:09,232 INFO L276 IsEmpty]: Start isEmpty. Operand 18469 states and 57954 transitions. [2019-12-18 21:50:09,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 21:50:09,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:09,242 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] [2019-12-18 21:50:09,242 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:50:09,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:09,243 INFO L82 PathProgramCache]: Analyzing trace with hash 700126081, now seen corresponding path program 1 times [2019-12-18 21:50:09,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:09,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784608181] [2019-12-18 21:50:09,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:09,328 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 21:50:09,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784608181] [2019-12-18 21:50:09,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:09,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:50:09,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218760470] [2019-12-18 21:50:09,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:50:09,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:09,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:50:09,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:50:09,330 INFO L87 Difference]: Start difference. First operand 18469 states and 57954 transitions. Second operand 6 states. [2019-12-18 21:50:09,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:09,413 INFO L93 Difference]: Finished difference Result 3432 states and 8687 transitions. [2019-12-18 21:50:09,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:50:09,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-18 21:50:09,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:09,419 INFO L225 Difference]: With dead ends: 3432 [2019-12-18 21:50:09,419 INFO L226 Difference]: Without dead ends: 3063 [2019-12-18 21:50:09,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:50:09,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3063 states. [2019-12-18 21:50:09,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 3063. [2019-12-18 21:50:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3063 states. [2019-12-18 21:50:09,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 7649 transitions. [2019-12-18 21:50:09,456 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 7649 transitions. Word has length 31 [2019-12-18 21:50:09,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:09,457 INFO L462 AbstractCegarLoop]: Abstraction has 3063 states and 7649 transitions. [2019-12-18 21:50:09,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:50:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 7649 transitions. [2019-12-18 21:50:09,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 21:50:09,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:09,461 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:50:09,461 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:50:09,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:09,461 INFO L82 PathProgramCache]: Analyzing trace with hash -196360051, now seen corresponding path program 1 times [2019-12-18 21:50:09,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:09,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162216943] [2019-12-18 21:50:09,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:09,575 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 21:50:09,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162216943] [2019-12-18 21:50:09,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:09,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:50:09,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888671307] [2019-12-18 21:50:09,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:50:09,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:09,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:50:09,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:50:09,577 INFO L87 Difference]: Start difference. First operand 3063 states and 7649 transitions. Second operand 7 states. [2019-12-18 21:50:09,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:09,693 INFO L93 Difference]: Finished difference Result 1341 states and 3748 transitions. [2019-12-18 21:50:09,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:50:09,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-18 21:50:09,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:09,696 INFO L225 Difference]: With dead ends: 1341 [2019-12-18 21:50:09,696 INFO L226 Difference]: Without dead ends: 1292 [2019-12-18 21:50:09,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:50:09,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-12-18 21:50:09,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1180. [2019-12-18 21:50:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2019-12-18 21:50:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 3332 transitions. [2019-12-18 21:50:09,712 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 3332 transitions. Word has length 43 [2019-12-18 21:50:09,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:09,712 INFO L462 AbstractCegarLoop]: Abstraction has 1180 states and 3332 transitions. [2019-12-18 21:50:09,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:50:09,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 3332 transitions. [2019-12-18 21:50:09,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:50:09,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:09,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:50:09,715 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:50:09,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:09,715 INFO L82 PathProgramCache]: Analyzing trace with hash 443866773, now seen corresponding path program 1 times [2019-12-18 21:50:09,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:09,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840128907] [2019-12-18 21:50:09,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:09,862 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 21:50:09,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840128907] [2019-12-18 21:50:09,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:09,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:50:09,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262329096] [2019-12-18 21:50:09,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:50:09,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:09,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:50:09,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:50:09,865 INFO L87 Difference]: Start difference. First operand 1180 states and 3332 transitions. Second operand 7 states. [2019-12-18 21:50:10,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:10,303 INFO L93 Difference]: Finished difference Result 1646 states and 4530 transitions. [2019-12-18 21:50:10,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 21:50:10,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-18 21:50:10,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:10,307 INFO L225 Difference]: With dead ends: 1646 [2019-12-18 21:50:10,307 INFO L226 Difference]: Without dead ends: 1646 [2019-12-18 21:50:10,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:50:10,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-12-18 21:50:10,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1509. [2019-12-18 21:50:10,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1509 states. [2019-12-18 21:50:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 4178 transitions. [2019-12-18 21:50:10,330 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 4178 transitions. Word has length 58 [2019-12-18 21:50:10,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:10,330 INFO L462 AbstractCegarLoop]: Abstraction has 1509 states and 4178 transitions. [2019-12-18 21:50:10,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:50:10,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 4178 transitions. [2019-12-18 21:50:10,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:50:10,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:10,334 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:50:10,334 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:50:10,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:10,334 INFO L82 PathProgramCache]: Analyzing trace with hash -2143304257, now seen corresponding path program 2 times [2019-12-18 21:50:10,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:10,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115740821] [2019-12-18 21:50:10,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:10,427 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 21:50:10,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115740821] [2019-12-18 21:50:10,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:10,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:50:10,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867601129] [2019-12-18 21:50:10,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:50:10,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:10,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:50:10,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:50:10,430 INFO L87 Difference]: Start difference. First operand 1509 states and 4178 transitions. Second operand 5 states. [2019-12-18 21:50:10,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:10,632 INFO L93 Difference]: Finished difference Result 1998 states and 5544 transitions. [2019-12-18 21:50:10,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:50:10,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 21:50:10,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:10,636 INFO L225 Difference]: With dead ends: 1998 [2019-12-18 21:50:10,636 INFO L226 Difference]: Without dead ends: 1998 [2019-12-18 21:50:10,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:50:10,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2019-12-18 21:50:10,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1605. [2019-12-18 21:50:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2019-12-18 21:50:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 4458 transitions. [2019-12-18 21:50:10,659 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 4458 transitions. Word has length 58 [2019-12-18 21:50:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:10,660 INFO L462 AbstractCegarLoop]: Abstraction has 1605 states and 4458 transitions. [2019-12-18 21:50:10,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:50:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 4458 transitions. [2019-12-18 21:50:10,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:50:10,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:10,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:50:10,663 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:50:10,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:10,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1535525935, now seen corresponding path program 3 times [2019-12-18 21:50:10,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:10,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344125772] [2019-12-18 21:50:10,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:50:10,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344125772] [2019-12-18 21:50:10,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:10,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:50:10,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970385821] [2019-12-18 21:50:10,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:50:10,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:10,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:50:10,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:50:10,730 INFO L87 Difference]: Start difference. First operand 1605 states and 4458 transitions. Second operand 3 states. [2019-12-18 21:50:10,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:10,747 INFO L93 Difference]: Finished difference Result 1465 states and 4030 transitions. [2019-12-18 21:50:10,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:50:10,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 21:50:10,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:10,750 INFO L225 Difference]: With dead ends: 1465 [2019-12-18 21:50:10,750 INFO L226 Difference]: Without dead ends: 1465 [2019-12-18 21:50:10,750 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 21:50:10,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2019-12-18 21:50:10,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1465. [2019-12-18 21:50:10,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1465 states. [2019-12-18 21:50:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 4030 transitions. [2019-12-18 21:50:10,773 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 4030 transitions. Word has length 58 [2019-12-18 21:50:10,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:10,774 INFO L462 AbstractCegarLoop]: Abstraction has 1465 states and 4030 transitions. [2019-12-18 21:50:10,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:50:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 4030 transitions. [2019-12-18 21:50:10,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:50:10,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:10,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:50:10,778 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:50:10,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:10,778 INFO L82 PathProgramCache]: Analyzing trace with hash 900965748, now seen corresponding path program 1 times [2019-12-18 21:50:10,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:10,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307783823] [2019-12-18 21:50:10,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:10,855 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 21:50:10,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307783823] [2019-12-18 21:50:10,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:10,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:50:10,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009406257] [2019-12-18 21:50:10,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:50:10,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:10,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:50:10,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:50:10,857 INFO L87 Difference]: Start difference. First operand 1465 states and 4030 transitions. Second operand 3 states. [2019-12-18 21:50:10,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:10,911 INFO L93 Difference]: Finished difference Result 1464 states and 4028 transitions. [2019-12-18 21:50:10,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:50:10,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:50:10,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:10,915 INFO L225 Difference]: With dead ends: 1464 [2019-12-18 21:50:10,916 INFO L226 Difference]: Without dead ends: 1464 [2019-12-18 21:50:10,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 21:50:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2019-12-18 21:50:10,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1159. [2019-12-18 21:50:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1159 states. [2019-12-18 21:50:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 3186 transitions. [2019-12-18 21:50:10,943 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 3186 transitions. Word has length 59 [2019-12-18 21:50:10,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:10,944 INFO L462 AbstractCegarLoop]: Abstraction has 1159 states and 3186 transitions. [2019-12-18 21:50:10,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:50:10,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 3186 transitions. [2019-12-18 21:50:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:50:10,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:10,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:50:10,948 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:50:10,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:10,948 INFO L82 PathProgramCache]: Analyzing trace with hash 319016150, now seen corresponding path program 1 times [2019-12-18 21:50:10,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:10,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032876432] [2019-12-18 21:50:10,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:11,215 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 21:50:11,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032876432] [2019-12-18 21:50:11,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:11,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:50:11,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60591040] [2019-12-18 21:50:11,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:50:11,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:11,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:50:11,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:50:11,217 INFO L87 Difference]: Start difference. First operand 1159 states and 3186 transitions. Second operand 12 states. [2019-12-18 21:50:11,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:11,927 INFO L93 Difference]: Finished difference Result 2520 states and 6210 transitions. [2019-12-18 21:50:11,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:50:11,928 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-18 21:50:11,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:11,931 INFO L225 Difference]: With dead ends: 2520 [2019-12-18 21:50:11,931 INFO L226 Difference]: Without dead ends: 1479 [2019-12-18 21:50:11,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:50:11,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2019-12-18 21:50:11,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1019. [2019-12-18 21:50:11,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-12-18 21:50:11,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 2715 transitions. [2019-12-18 21:50:11,944 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 2715 transitions. Word has length 60 [2019-12-18 21:50:11,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:11,945 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 2715 transitions. [2019-12-18 21:50:11,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:50:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 2715 transitions. [2019-12-18 21:50:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:50:11,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:11,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:50:11,947 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:50:11,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:11,947 INFO L82 PathProgramCache]: Analyzing trace with hash 792391964, now seen corresponding path program 2 times [2019-12-18 21:50:11,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:11,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760032001] [2019-12-18 21:50:11,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:12,185 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 21:50:12,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760032001] [2019-12-18 21:50:12,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:12,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:50:12,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815695514] [2019-12-18 21:50:12,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:50:12,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:12,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:50:12,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:50:12,187 INFO L87 Difference]: Start difference. First operand 1019 states and 2715 transitions. Second operand 13 states. [2019-12-18 21:50:12,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:12,884 INFO L93 Difference]: Finished difference Result 2571 states and 6187 transitions. [2019-12-18 21:50:12,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:50:12,884 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 21:50:12,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:12,885 INFO L225 Difference]: With dead ends: 2571 [2019-12-18 21:50:12,885 INFO L226 Difference]: Without dead ends: 795 [2019-12-18 21:50:12,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:50:12,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-12-18 21:50:12,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 570. [2019-12-18 21:50:12,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-12-18 21:50:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1221 transitions. [2019-12-18 21:50:12,899 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1221 transitions. Word has length 60 [2019-12-18 21:50:12,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:12,899 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 1221 transitions. [2019-12-18 21:50:12,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:50:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1221 transitions. [2019-12-18 21:50:12,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:50:12,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:12,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:50:12,901 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:50:12,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:12,901 INFO L82 PathProgramCache]: Analyzing trace with hash -631890150, now seen corresponding path program 3 times [2019-12-18 21:50:12,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:12,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066125550] [2019-12-18 21:50:12,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:13,056 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 21:50:13,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066125550] [2019-12-18 21:50:13,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:13,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:50:13,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600724448] [2019-12-18 21:50:13,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:50:13,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:13,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:50:13,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:50:13,058 INFO L87 Difference]: Start difference. First operand 570 states and 1221 transitions. Second operand 6 states. [2019-12-18 21:50:13,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:13,149 INFO L93 Difference]: Finished difference Result 807 states and 1666 transitions. [2019-12-18 21:50:13,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:50:13,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 21:50:13,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:13,150 INFO L225 Difference]: With dead ends: 807 [2019-12-18 21:50:13,150 INFO L226 Difference]: Without dead ends: 238 [2019-12-18 21:50:13,151 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 21:50:13,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-12-18 21:50:13,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 214. [2019-12-18 21:50:13,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-12-18 21:50:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 362 transitions. [2019-12-18 21:50:13,156 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 362 transitions. Word has length 60 [2019-12-18 21:50:13,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:13,156 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 362 transitions. [2019-12-18 21:50:13,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:50:13,156 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 362 transitions. [2019-12-18 21:50:13,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:50:13,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:13,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:50:13,158 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:50:13,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:13,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1041044752, now seen corresponding path program 4 times [2019-12-18 21:50:13,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:13,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838103254] [2019-12-18 21:50:13,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:13,416 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 21:50:13,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838103254] [2019-12-18 21:50:13,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:13,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:50:13,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633734541] [2019-12-18 21:50:13,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:50:13,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:13,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:50:13,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:50:13,420 INFO L87 Difference]: Start difference. First operand 214 states and 362 transitions. Second operand 13 states. [2019-12-18 21:50:13,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:13,733 INFO L93 Difference]: Finished difference Result 372 states and 620 transitions. [2019-12-18 21:50:13,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:50:13,733 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 21:50:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:13,734 INFO L225 Difference]: With dead ends: 372 [2019-12-18 21:50:13,734 INFO L226 Difference]: Without dead ends: 340 [2019-12-18 21:50:13,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:50:13,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-12-18 21:50:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 322. [2019-12-18 21:50:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-18 21:50:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 547 transitions. [2019-12-18 21:50:13,742 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 547 transitions. Word has length 60 [2019-12-18 21:50:13,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:13,743 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 547 transitions. [2019-12-18 21:50:13,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:50:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 547 transitions. [2019-12-18 21:50:13,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:50:13,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:13,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:50:13,745 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:50:13,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:13,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1167049754, now seen corresponding path program 5 times [2019-12-18 21:50:13,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:13,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623346996] [2019-12-18 21:50:13,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:50:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:50:13,946 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:50:13,947 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:50:13,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~__unbuffered_p3_EAX~0_10) (= v_~z$r_buff0_thd4~0_27 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_26 0) (= v_~main$tmp_guard1~0_11 0) (= 0 v_~z$r_buff1_thd3~0_18) (< 0 |v_#StackHeapBarrier_21|) (= v_~x~0_13 0) (= 0 v_~z$w_buff1~0_21) (= 0 v_~z$r_buff1_thd4~0_20) (= 0 v_~z$flush_delayed~0_15) (= (select .cse0 |v_ULTIMATE.start_main_~#t1469~0.base_22|) 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd3~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= v_~z$w_buff0_used~0_105 0) (= 0 v_~z$r_buff1_thd0~0_48) (= 0 v_~z$r_buff1_thd2~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= v_~z$r_buff0_thd1~0_9 0) (= v_~z$mem_tmp~0_10 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1469~0.base_22| 4)) (= 0 |v_ULTIMATE.start_main_~#t1469~0.offset_17|) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$r_buff0_thd2~0_9 0) (= v_~y~0_10 0) (= 0 v_~z$w_buff0~0_25) (= 0 v_~z$w_buff1_used~0_65) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1469~0.base_22|) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1469~0.base_22| 1)) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1469~0.base_22| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1469~0.base_22|) |v_ULTIMATE.start_main_~#t1469~0.offset_17| 0)) |v_#memory_int_27|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t1470~0.offset=|v_ULTIMATE.start_main_~#t1470~0.offset_18|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, ULTIMATE.start_main_~#t1470~0.base=|v_ULTIMATE.start_main_~#t1470~0.base_23|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_16|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ~a~0=v_~a~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, #length=|v_#length_31|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_65, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_16|, ULTIMATE.start_main_~#t1471~0.base=|v_ULTIMATE.start_main_~#t1471~0.base_20|, ~z$flush_delayed~0=v_~z$flush_delayed~0_15, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_13|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_16|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ULTIMATE.start_main_~#t1472~0.base=|v_ULTIMATE.start_main_~#t1472~0.base_20|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x~0=v_~x~0_13, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_14|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~z$w_buff1~0=v_~z$w_buff1~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_15|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_16|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_48, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_9|, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ULTIMATE.start_main_~#t1469~0.base=|v_ULTIMATE.start_main_~#t1469~0.base_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_17|, ULTIMATE.start_main_~#t1472~0.offset=|v_ULTIMATE.start_main_~#t1472~0.offset_16|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_~#t1471~0.offset=|v_ULTIMATE.start_main_~#t1471~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~#t1469~0.offset=|v_ULTIMATE.start_main_~#t1469~0.offset_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1470~0.offset, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1470~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t1471~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1472~0.base, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1469~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1472~0.offset, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1471~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1469~0.offset, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:50:13,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L823-1-->L825: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1470~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1470~0.offset_11| 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1470~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1470~0.base_13|) |v_ULTIMATE.start_main_~#t1470~0.offset_11| 1)) |v_#memory_int_19|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1470~0.base_13| 4) |v_#length_23|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1470~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1470~0.base_13| 0)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1470~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1470~0.offset=|v_ULTIMATE.start_main_~#t1470~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1470~0.base=|v_ULTIMATE.start_main_~#t1470~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1470~0.offset, ULTIMATE.start_main_~#t1470~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 21:50:13,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L825-1-->L827: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1471~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1471~0.base_10|) |v_ULTIMATE.start_main_~#t1471~0.offset_10| 2)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1471~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1471~0.base_10|) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1471~0.base_10| 1) |v_#valid_40|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1471~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1471~0.offset_10| 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1471~0.base_10| 4) |v_#length_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1471~0.offset=|v_ULTIMATE.start_main_~#t1471~0.offset_10|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1471~0.base=|v_ULTIMATE.start_main_~#t1471~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1471~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1471~0.base] because there is no mapped edge [2019-12-18 21:50:13,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L827-1-->L829: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1472~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1472~0.offset_10| 0) (= (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1472~0.base_11| 1) |v_#valid_44|) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1472~0.base_11|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1472~0.base_11| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1472~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1472~0.base_11|) |v_ULTIMATE.start_main_~#t1472~0.offset_10| 3)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1472~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1472~0.base=|v_ULTIMATE.start_main_~#t1472~0.base_11|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1472~0.offset=|v_ULTIMATE.start_main_~#t1472~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1472~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1472~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-18 21:50:13,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L4-->L800: Formula: (and (= ~z$r_buff1_thd2~0_Out-1563999840 ~z$r_buff0_thd2~0_In-1563999840) (= ~z$r_buff0_thd3~0_In-1563999840 ~z$r_buff1_thd3~0_Out-1563999840) (not (= 0 P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1563999840)) (= ~z$r_buff0_thd4~0_Out-1563999840 1) (= ~a~0_In-1563999840 ~__unbuffered_p3_EAX~0_Out-1563999840) (= ~z$r_buff1_thd1~0_Out-1563999840 ~z$r_buff0_thd1~0_In-1563999840) (= ~z$r_buff1_thd4~0_Out-1563999840 ~z$r_buff0_thd4~0_In-1563999840) (= ~z$r_buff0_thd0~0_In-1563999840 ~z$r_buff1_thd0~0_Out-1563999840)) InVars {~a~0=~a~0_In-1563999840, P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1563999840, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1563999840, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1563999840, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1563999840, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1563999840, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1563999840} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1563999840, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1563999840, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1563999840, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1563999840, ~a~0=~a~0_In-1563999840, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1563999840, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1563999840, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1563999840, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1563999840, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1563999840, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1563999840, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1563999840, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1563999840} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 21:50:13,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~a~0_6) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~a~0=v_~a~0_6, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_9, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:50:13,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~__unbuffered_p1_EAX~0_7 v_~y~0_7) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~x~0_10 2) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y~0=v_~y~0_7} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~y~0=v_~y~0_7, ~x~0=v_~x~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:50:13,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1052619098 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1052619098 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite11_Out1052619098| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out1052619098| ~z$w_buff0_used~0_In1052619098)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1052619098, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1052619098} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1052619098, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1052619098, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1052619098|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 21:50:13,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L770-2-->L770-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-361376107 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-361376107 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite3_Out-361376107| ~z~0_In-361376107)) (and (= |P2Thread1of1ForFork2_#t~ite3_Out-361376107| ~z$w_buff1~0_In-361376107) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-361376107, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-361376107, ~z$w_buff1~0=~z$w_buff1~0_In-361376107, ~z~0=~z~0_In-361376107} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-361376107|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-361376107, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-361376107, ~z$w_buff1~0=~z$w_buff1~0_In-361376107, ~z~0=~z~0_In-361376107} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:50:13,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L770-4-->L771: Formula: (= v_~z~0_19 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 21:50:13,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1183128628 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1183128628 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1183128628 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In-1183128628 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite12_Out-1183128628| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork3_#t~ite12_Out-1183128628| ~z$w_buff1_used~0_In-1183128628) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1183128628, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1183128628, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1183128628, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1183128628} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1183128628, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1183128628, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1183128628, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1183128628, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-1183128628|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 21:50:13,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L803-->L804: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-594689950 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-594689950 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-594689950 ~z$r_buff0_thd4~0_In-594689950)) (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out-594689950 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-594689950, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-594689950} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-594689950, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-594689950, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-594689950|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 21:50:13,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L804-->L804-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In694727273 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In694727273 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In694727273 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In694727273 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In694727273 |P3Thread1of1ForFork3_#t~ite14_Out694727273|) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork3_#t~ite14_Out694727273|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In694727273, ~z$w_buff0_used~0=~z$w_buff0_used~0_In694727273, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In694727273, ~z$w_buff1_used~0=~z$w_buff1_used~0_In694727273} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In694727273, ~z$w_buff0_used~0=~z$w_buff0_used~0_In694727273, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out694727273|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In694727273, ~z$w_buff1_used~0=~z$w_buff1_used~0_In694727273} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 21:50:13,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L804-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_16) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 21:50:13,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-106968010 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-106968010 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite5_Out-106968010| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out-106968010| ~z$w_buff0_used~0_In-106968010)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-106968010, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-106968010} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-106968010|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-106968010, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-106968010} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:50:13,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L772-->L772-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-35892571 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-35892571 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-35892571 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-35892571 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-35892571|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-35892571 |P2Thread1of1ForFork2_#t~ite6_Out-35892571|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-35892571, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-35892571, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-35892571, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-35892571} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-35892571|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-35892571, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-35892571, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-35892571, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-35892571} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:50:13,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-645680337 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-645680337 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out-645680337| ~z$r_buff0_thd3~0_In-645680337)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out-645680337| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-645680337, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-645680337} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-645680337, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-645680337, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-645680337|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:50:13,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L774-->L774-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1711792353 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1711792353 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1711792353 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1711792353 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite8_Out1711792353|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In1711792353 |P2Thread1of1ForFork2_#t~ite8_Out1711792353|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1711792353, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1711792353, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1711792353, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1711792353} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1711792353, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1711792353, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1711792353, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1711792353, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out1711792353|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:50:13,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_24 1) v_~__unbuffered_cnt~0_23) (= v_~z$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork2_#t~ite8_8|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:50:13,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L833-->L835-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_50 256)) (= 0 (mod v_~z$w_buff0_used~0_72 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_50, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_72, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_50, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_72, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:50:13,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In440442377 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In440442377 256) 0))) (or (and (= ~z~0_In440442377 |ULTIMATE.start_main_#t~ite19_Out440442377|) (or .cse0 .cse1)) (and (not .cse0) (= ~z$w_buff1~0_In440442377 |ULTIMATE.start_main_#t~ite19_Out440442377|) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In440442377, ~z$w_buff1_used~0=~z$w_buff1_used~0_In440442377, ~z$w_buff1~0=~z$w_buff1~0_In440442377, ~z~0=~z~0_In440442377} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out440442377|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In440442377, ~z$w_buff1_used~0=~z$w_buff1_used~0_In440442377, ~z$w_buff1~0=~z$w_buff1~0_In440442377, ~z~0=~z~0_In440442377} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:50:13,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-4-->L836: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_18, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:50:13,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In41418666 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In41418666 256)))) (or (and (= ~z$w_buff0_used~0_In41418666 |ULTIMATE.start_main_#t~ite21_Out41418666|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out41418666| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In41418666, ~z$w_buff0_used~0=~z$w_buff0_used~0_In41418666} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In41418666, ~z$w_buff0_used~0=~z$w_buff0_used~0_In41418666, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out41418666|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:50:13,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L837-->L837-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1489091244 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1489091244 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1489091244 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1489091244 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-1489091244|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1489091244 |ULTIMATE.start_main_#t~ite22_Out-1489091244|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1489091244, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1489091244, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1489091244, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1489091244} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1489091244, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1489091244, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1489091244, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1489091244, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1489091244|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:50:13,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L838-->L838-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-2142743519 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-2142743519 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite23_Out-2142743519|)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-2142743519 |ULTIMATE.start_main_#t~ite23_Out-2142743519|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2142743519, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2142743519} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2142743519, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2142743519, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-2142743519|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:50:13,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L839-->L839-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-89182130 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-89182130 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-89182130 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-89182130 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-89182130 |ULTIMATE.start_main_#t~ite24_Out-89182130|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite24_Out-89182130|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-89182130, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-89182130, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-89182130, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-89182130} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-89182130, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-89182130, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-89182130, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-89182130|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-89182130} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 21:50:13,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L848-->L848-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In609924783 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In609924783 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In609924783 256)) .cse0) (and (= (mod ~z$r_buff1_thd0~0_In609924783 256) 0) .cse0) (= (mod ~z$w_buff0_used~0_In609924783 256) 0))) (= |ULTIMATE.start_main_#t~ite33_Out609924783| ~z$w_buff1~0_In609924783) .cse1 (= |ULTIMATE.start_main_#t~ite34_Out609924783| |ULTIMATE.start_main_#t~ite33_Out609924783|)) (and (= |ULTIMATE.start_main_#t~ite34_Out609924783| ~z$w_buff1~0_In609924783) (not .cse1) (= |ULTIMATE.start_main_#t~ite33_In609924783| |ULTIMATE.start_main_#t~ite33_Out609924783|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In609924783, ~z$w_buff0_used~0=~z$w_buff0_used~0_In609924783, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In609924783, ~z$w_buff1_used~0=~z$w_buff1_used~0_In609924783, ~z$w_buff1~0=~z$w_buff1~0_In609924783, ~weak$$choice2~0=~weak$$choice2~0_In609924783, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In609924783|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In609924783, ~z$w_buff0_used~0=~z$w_buff0_used~0_In609924783, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In609924783, ~z$w_buff1_used~0=~z$w_buff1_used~0_In609924783, ~z$w_buff1~0=~z$w_buff1~0_In609924783, ~weak$$choice2~0=~weak$$choice2~0_In609924783, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out609924783|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out609924783|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 21:50:13,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L850-->L850-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In85418821 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out85418821| ~z$w_buff1_used~0_In85418821) (= |ULTIMATE.start_main_#t~ite39_Out85418821| |ULTIMATE.start_main_#t~ite40_Out85418821|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In85418821 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In85418821 256) 0)) (and (= (mod ~z$r_buff1_thd0~0_In85418821 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In85418821 256) 0)))) (and (= |ULTIMATE.start_main_#t~ite39_In85418821| |ULTIMATE.start_main_#t~ite39_Out85418821|) (not .cse0) (= ~z$w_buff1_used~0_In85418821 |ULTIMATE.start_main_#t~ite40_Out85418821|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In85418821, ~z$w_buff0_used~0=~z$w_buff0_used~0_In85418821, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In85418821|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In85418821, ~z$w_buff1_used~0=~z$w_buff1_used~0_In85418821, ~weak$$choice2~0=~weak$$choice2~0_In85418821} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In85418821, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out85418821|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out85418821|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In85418821, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In85418821, ~z$w_buff1_used~0=~z$w_buff1_used~0_In85418821, ~weak$$choice2~0=~weak$$choice2~0_In85418821} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:50:13,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L851-->L852: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd0~0_69 v_~z$r_buff0_thd0~0_70)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:50:13,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L852-->L852-8: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-45793862 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-45793862 256) 0)) (.cse6 (= 0 (mod ~z$r_buff0_thd0~0_In-45793862 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-45793862 256) 0)) (.cse4 (= |ULTIMATE.start_main_#t~ite46_Out-45793862| |ULTIMATE.start_main_#t~ite45_Out-45793862|)) (.cse5 (= 0 (mod ~weak$$choice2~0_In-45793862 256)))) (or (let ((.cse0 (not .cse6))) (and (= |ULTIMATE.start_main_#t~ite44_Out-45793862| 0) (or .cse0 (not .cse1)) (= |ULTIMATE.start_main_#t~ite44_Out-45793862| |ULTIMATE.start_main_#t~ite45_Out-45793862|) (or (not .cse2) .cse0) (not .cse3) .cse4 .cse5)) (and (= |ULTIMATE.start_main_#t~ite44_In-45793862| |ULTIMATE.start_main_#t~ite44_Out-45793862|) (or (and (= ~z$r_buff1_thd0~0_In-45793862 |ULTIMATE.start_main_#t~ite45_Out-45793862|) (or (and .cse2 .cse6) .cse3 (and .cse6 .cse1)) .cse4 .cse5) (and (= |ULTIMATE.start_main_#t~ite45_In-45793862| |ULTIMATE.start_main_#t~ite45_Out-45793862|) (not .cse5) (= ~z$r_buff1_thd0~0_In-45793862 |ULTIMATE.start_main_#t~ite46_Out-45793862|)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-45793862, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-45793862, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-45793862, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-45793862, ~weak$$choice2~0=~weak$$choice2~0_In-45793862, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-45793862|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-45793862|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-45793862, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-45793862, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-45793862, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-45793862, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-45793862|, ~weak$$choice2~0=~weak$$choice2~0_In-45793862, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-45793862|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-45793862|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:50:13,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L854-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_22 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:50:13,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 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_10, 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 21:50:14,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:50:14 BasicIcfg [2019-12-18 21:50:14,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:50:14,084 INFO L168 Benchmark]: Toolchain (without parser) took 36460.45 ms. Allocated memory was 146.3 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 102.3 MB in the beginning and 930.9 MB in the end (delta: -828.6 MB). Peak memory consumption was 862.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:50:14,084 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 21:50:14,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 828.59 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 157.4 MB in the end (delta: -55.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:50:14,086 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.81 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:50:14,089 INFO L168 Benchmark]: Boogie Preprocessor took 39.40 ms. Allocated memory is still 203.9 MB. Free memory was 154.2 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:50:14,090 INFO L168 Benchmark]: RCFGBuilder took 821.42 ms. Allocated memory is still 203.9 MB. Free memory was 151.7 MB in the beginning and 102.4 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:50:14,092 INFO L168 Benchmark]: TraceAbstraction took 34694.12 ms. Allocated memory was 203.9 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 102.4 MB in the beginning and 930.9 MB in the end (delta: -828.5 MB). Peak memory consumption was 805.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:50:14,098 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.50 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 828.59 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 157.4 MB in the end (delta: -55.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.81 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.40 ms. Allocated memory is still 203.9 MB. Free memory was 154.2 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 821.42 ms. Allocated memory is still 203.9 MB. Free memory was 151.7 MB in the beginning and 102.4 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34694.12 ms. Allocated memory was 203.9 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 102.4 MB in the beginning and 930.9 MB in the end (delta: -828.5 MB). Peak memory consumption was 805.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 179 ProgramPointsBefore, 91 ProgramPointsAfterwards, 207 TransitionsBefore, 96 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 4854 VarBasedMoverChecksPositive, 171 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51526 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t1469, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t1470, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1471, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t1472, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L784] 4 z$w_buff1 = z$w_buff0 [L785] 4 z$w_buff0 = 2 [L786] 4 z$w_buff1_used = z$w_buff0_used [L787] 4 z$w_buff0_used = (_Bool)1 [L800] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 3 y = 1 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L770] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L839] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 z$flush_delayed = weak$$choice2 [L845] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L847] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L848] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L849] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 34.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2049 SDtfs, 2890 SDslu, 5277 SDs, 0 SdLazy, 2282 SolverSat, 220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 27 SyntacticMatches, 11 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51558occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 33653 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 672 ConstructedInterpolants, 0 QuantifiedInterpolants, 142479 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...