/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:33:03,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:33:03,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:33:03,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:33:03,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:33:03,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:33:03,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:33:03,406 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:33:03,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:33:03,413 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:33:03,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:33:03,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:33:03,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:33:03,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:33:03,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:33:03,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:33:03,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:33:03,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:33:03,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:33:03,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:33:03,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:33:03,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:33:03,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:33:03,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:33:03,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:33:03,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:33:03,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:33:03,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:33:03,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:33:03,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:33:03,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:33:03,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:33:03,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:33:03,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:33:03,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:33:03,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:33:03,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:33:03,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:33:03,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:33:03,447 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:33:03,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:33:03,448 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:33:03,462 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:33:03,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:33:03,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:33:03,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:33:03,463 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:33:03,464 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:33:03,464 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:33:03,464 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:33:03,464 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:33:03,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:33:03,465 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:33:03,465 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:33:03,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:33:03,465 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:33:03,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:33:03,465 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:33:03,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:33:03,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:33:03,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:33:03,466 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:33:03,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:33:03,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:33:03,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:33:03,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:33:03,467 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:33:03,467 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:33:03,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:33:03,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:33:03,468 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:33:03,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:33:03,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:33:03,744 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:33:03,746 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:33:03,746 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:33:03,747 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i [2019-12-18 17:33:03,824 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c129d644/5b63dc28e2b74d4c91e4fc9dc5d3937a/FLAG7f138f522 [2019-12-18 17:33:04,419 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:33:04,419 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i [2019-12-18 17:33:04,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c129d644/5b63dc28e2b74d4c91e4fc9dc5d3937a/FLAG7f138f522 [2019-12-18 17:33:04,756 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c129d644/5b63dc28e2b74d4c91e4fc9dc5d3937a [2019-12-18 17:33:04,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:33:04,766 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:33:04,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:33:04,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:33:04,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:33:04,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:33:04" (1/1) ... [2019-12-18 17:33:04,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51df9b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:04, skipping insertion in model container [2019-12-18 17:33:04,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:33:04" (1/1) ... [2019-12-18 17:33:04,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:33:04,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:33:05,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:33:05,354 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:33:05,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:33:05,504 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:33:05,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:05 WrapperNode [2019-12-18 17:33:05,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:33:05,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:33:05,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:33:05,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:33:05,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:05" (1/1) ... [2019-12-18 17:33:05,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:05" (1/1) ... [2019-12-18 17:33:05,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:33:05,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:33:05,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:33:05,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:33:05,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:05" (1/1) ... [2019-12-18 17:33:05,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:05" (1/1) ... [2019-12-18 17:33:05,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:05" (1/1) ... [2019-12-18 17:33:05,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:05" (1/1) ... [2019-12-18 17:33:05,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:05" (1/1) ... [2019-12-18 17:33:05,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:05" (1/1) ... [2019-12-18 17:33:05,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:05" (1/1) ... [2019-12-18 17:33:05,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:33:05,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:33:05,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:33:05,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:33:05,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:05" (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 17:33:05,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:33:05,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:33:05,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:33:05,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:33:05,687 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:33:05,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:33:05,687 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:33:05,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:33:05,687 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:33:05,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:33:05,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:33:05,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:33:05,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:33:05,690 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 17:33:06,437 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:33:06,438 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:33:06,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:33:06 BoogieIcfgContainer [2019-12-18 17:33:06,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:33:06,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:33:06,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:33:06,444 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:33:06,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:33:04" (1/3) ... [2019-12-18 17:33:06,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a090262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:33:06, skipping insertion in model container [2019-12-18 17:33:06,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:05" (2/3) ... [2019-12-18 17:33:06,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a090262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:33:06, skipping insertion in model container [2019-12-18 17:33:06,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:33:06" (3/3) ... [2019-12-18 17:33:06,449 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_pso.opt.i [2019-12-18 17:33:06,460 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:33:06,460 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:33:06,468 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:33:06,469 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:33:06,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,508 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,509 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,511 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,511 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,525 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,525 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,527 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,528 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,528 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,541 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,542 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,543 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,547 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,548 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,550 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,550 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:06,586 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:33:06,609 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:33:06,610 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:33:06,610 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:33:06,610 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:33:06,610 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:33:06,611 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:33:06,614 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:33:06,614 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:33:06,641 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 17:33:06,642 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 17:33:06,723 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 17:33:06,723 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:33:06,736 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 17:33:06,759 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 17:33:06,800 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 17:33:06,801 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:33:06,808 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 17:33:06,827 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 17:33:06,828 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:33:11,640 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 17:33:11,773 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 17:33:11,793 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46792 [2019-12-18 17:33:11,794 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 17:33:11,797 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-18 17:33:12,870 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16134 states. [2019-12-18 17:33:12,872 INFO L276 IsEmpty]: Start isEmpty. Operand 16134 states. [2019-12-18 17:33:12,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 17:33:12,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:12,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:12,879 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:12,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:12,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1643101290, now seen corresponding path program 1 times [2019-12-18 17:33:12,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:12,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384145560] [2019-12-18 17:33:12,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:13,140 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 17:33:13,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384145560] [2019-12-18 17:33:13,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:13,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:33:13,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346930360] [2019-12-18 17:33:13,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:33:13,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:13,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:33:13,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:33:13,171 INFO L87 Difference]: Start difference. First operand 16134 states. Second operand 3 states. [2019-12-18 17:33:13,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:13,591 INFO L93 Difference]: Finished difference Result 16034 states and 60310 transitions. [2019-12-18 17:33:13,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:33:13,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 17:33:13,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:13,827 INFO L225 Difference]: With dead ends: 16034 [2019-12-18 17:33:13,827 INFO L226 Difference]: Without dead ends: 15698 [2019-12-18 17:33:13,828 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 17:33:14,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15698 states. [2019-12-18 17:33:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15698 to 15698. [2019-12-18 17:33:15,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15698 states. [2019-12-18 17:33:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15698 states to 15698 states and 59106 transitions. [2019-12-18 17:33:15,257 INFO L78 Accepts]: Start accepts. Automaton has 15698 states and 59106 transitions. Word has length 7 [2019-12-18 17:33:15,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:15,258 INFO L462 AbstractCegarLoop]: Abstraction has 15698 states and 59106 transitions. [2019-12-18 17:33:15,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:33:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 15698 states and 59106 transitions. [2019-12-18 17:33:15,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:33:15,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:15,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:15,264 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:15,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:15,265 INFO L82 PathProgramCache]: Analyzing trace with hash 565568960, now seen corresponding path program 1 times [2019-12-18 17:33:15,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:15,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456319134] [2019-12-18 17:33:15,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:15,436 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 17:33:15,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456319134] [2019-12-18 17:33:15,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:15,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:33:15,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921565008] [2019-12-18 17:33:15,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:33:15,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:15,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:33:15,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:33:15,440 INFO L87 Difference]: Start difference. First operand 15698 states and 59106 transitions. Second operand 4 states. [2019-12-18 17:33:16,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:16,231 INFO L93 Difference]: Finished difference Result 24414 states and 88322 transitions. [2019-12-18 17:33:16,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:33:16,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 17:33:16,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:16,337 INFO L225 Difference]: With dead ends: 24414 [2019-12-18 17:33:16,337 INFO L226 Difference]: Without dead ends: 24400 [2019-12-18 17:33:16,338 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 17:33:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24400 states. [2019-12-18 17:33:17,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24400 to 22284. [2019-12-18 17:33:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22284 states. [2019-12-18 17:33:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22284 states to 22284 states and 81513 transitions. [2019-12-18 17:33:17,221 INFO L78 Accepts]: Start accepts. Automaton has 22284 states and 81513 transitions. Word has length 13 [2019-12-18 17:33:17,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:17,221 INFO L462 AbstractCegarLoop]: Abstraction has 22284 states and 81513 transitions. [2019-12-18 17:33:17,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:33:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 22284 states and 81513 transitions. [2019-12-18 17:33:17,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:33:17,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:17,225 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:17,225 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:17,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:17,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1863901117, now seen corresponding path program 1 times [2019-12-18 17:33:17,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:17,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453543977] [2019-12-18 17:33:17,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:17,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:33:17,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453543977] [2019-12-18 17:33:17,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:17,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:33:17,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201621509] [2019-12-18 17:33:17,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:33:17,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:17,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:33:17,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:33:17,284 INFO L87 Difference]: Start difference. First operand 22284 states and 81513 transitions. Second operand 3 states. [2019-12-18 17:33:17,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:17,334 INFO L93 Difference]: Finished difference Result 12731 states and 40311 transitions. [2019-12-18 17:33:17,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:33:17,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:33:17,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:17,386 INFO L225 Difference]: With dead ends: 12731 [2019-12-18 17:33:17,386 INFO L226 Difference]: Without dead ends: 12731 [2019-12-18 17:33:17,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:33:17,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12731 states. [2019-12-18 17:33:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12731 to 12731. [2019-12-18 17:33:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12731 states. [2019-12-18 17:33:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12731 states to 12731 states and 40311 transitions. [2019-12-18 17:33:18,769 INFO L78 Accepts]: Start accepts. Automaton has 12731 states and 40311 transitions. Word has length 13 [2019-12-18 17:33:18,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:18,770 INFO L462 AbstractCegarLoop]: Abstraction has 12731 states and 40311 transitions. [2019-12-18 17:33:18,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:33:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 12731 states and 40311 transitions. [2019-12-18 17:33:18,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:33:18,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:18,772 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:18,772 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:18,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:18,772 INFO L82 PathProgramCache]: Analyzing trace with hash -709244429, now seen corresponding path program 1 times [2019-12-18 17:33:18,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:18,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182498881] [2019-12-18 17:33:18,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:18,860 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 17:33:18,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182498881] [2019-12-18 17:33:18,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:18,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:33:18,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171725251] [2019-12-18 17:33:18,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:33:18,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:18,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:33:18,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:33:18,864 INFO L87 Difference]: Start difference. First operand 12731 states and 40311 transitions. Second operand 4 states. [2019-12-18 17:33:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:18,887 INFO L93 Difference]: Finished difference Result 1935 states and 4522 transitions. [2019-12-18 17:33:18,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:33:18,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 17:33:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:18,894 INFO L225 Difference]: With dead ends: 1935 [2019-12-18 17:33:18,894 INFO L226 Difference]: Without dead ends: 1935 [2019-12-18 17:33:18,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:33:18,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-18 17:33:18,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-18 17:33:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-18 17:33:18,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4522 transitions. [2019-12-18 17:33:18,927 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4522 transitions. Word has length 14 [2019-12-18 17:33:18,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:18,928 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4522 transitions. [2019-12-18 17:33:18,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:33:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4522 transitions. [2019-12-18 17:33:18,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 17:33:18,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:18,931 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:18,931 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:18,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:18,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1471989024, now seen corresponding path program 1 times [2019-12-18 17:33:18,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:18,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986300006] [2019-12-18 17:33:18,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:19,055 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 17:33:19,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986300006] [2019-12-18 17:33:19,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:19,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:33:19,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730038376] [2019-12-18 17:33:19,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:33:19,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:19,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:33:19,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:33:19,059 INFO L87 Difference]: Start difference. First operand 1935 states and 4522 transitions. Second operand 5 states. [2019-12-18 17:33:19,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:19,085 INFO L93 Difference]: Finished difference Result 652 states and 1532 transitions. [2019-12-18 17:33:19,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:33:19,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 17:33:19,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:19,087 INFO L225 Difference]: With dead ends: 652 [2019-12-18 17:33:19,088 INFO L226 Difference]: Without dead ends: 652 [2019-12-18 17:33:19,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:33:19,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-12-18 17:33:19,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 596. [2019-12-18 17:33:19,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-18 17:33:19,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1400 transitions. [2019-12-18 17:33:19,101 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1400 transitions. Word has length 26 [2019-12-18 17:33:19,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:19,101 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1400 transitions. [2019-12-18 17:33:19,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:33:19,101 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1400 transitions. [2019-12-18 17:33:19,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:33:19,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:19,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:19,106 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:19,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:19,107 INFO L82 PathProgramCache]: Analyzing trace with hash 827870922, now seen corresponding path program 1 times [2019-12-18 17:33:19,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:19,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381608622] [2019-12-18 17:33:19,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:19,199 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 17:33:19,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381608622] [2019-12-18 17:33:19,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:19,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:33:19,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003169504] [2019-12-18 17:33:19,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:33:19,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:19,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:33:19,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:33:19,201 INFO L87 Difference]: Start difference. First operand 596 states and 1400 transitions. Second operand 3 states. [2019-12-18 17:33:19,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:19,250 INFO L93 Difference]: Finished difference Result 608 states and 1417 transitions. [2019-12-18 17:33:19,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:33:19,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 17:33:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:19,253 INFO L225 Difference]: With dead ends: 608 [2019-12-18 17:33:19,253 INFO L226 Difference]: Without dead ends: 608 [2019-12-18 17:33:19,254 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 17:33:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-18 17:33:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2019-12-18 17:33:19,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-18 17:33:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1413 transitions. [2019-12-18 17:33:19,265 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1413 transitions. Word has length 55 [2019-12-18 17:33:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:19,265 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1413 transitions. [2019-12-18 17:33:19,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:33:19,266 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1413 transitions. [2019-12-18 17:33:19,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:33:19,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:19,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:19,268 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:19,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:19,268 INFO L82 PathProgramCache]: Analyzing trace with hash -345025503, now seen corresponding path program 1 times [2019-12-18 17:33:19,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:19,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957115059] [2019-12-18 17:33:19,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:19,332 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 17:33:19,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957115059] [2019-12-18 17:33:19,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:19,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:33:19,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044600592] [2019-12-18 17:33:19,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:33:19,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:19,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:33:19,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:33:19,334 INFO L87 Difference]: Start difference. First operand 604 states and 1413 transitions. Second operand 3 states. [2019-12-18 17:33:19,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:19,376 INFO L93 Difference]: Finished difference Result 608 states and 1410 transitions. [2019-12-18 17:33:19,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:33:19,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 17:33:19,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:19,379 INFO L225 Difference]: With dead ends: 608 [2019-12-18 17:33:19,379 INFO L226 Difference]: Without dead ends: 608 [2019-12-18 17:33:19,379 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 17:33:19,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-18 17:33:19,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2019-12-18 17:33:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-18 17:33:19,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1406 transitions. [2019-12-18 17:33:19,389 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1406 transitions. Word has length 55 [2019-12-18 17:33:19,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:19,390 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1406 transitions. [2019-12-18 17:33:19,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:33:19,390 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1406 transitions. [2019-12-18 17:33:19,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:33:19,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:19,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:19,392 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:19,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:19,393 INFO L82 PathProgramCache]: Analyzing trace with hash -349465323, now seen corresponding path program 1 times [2019-12-18 17:33:19,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:19,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797541957] [2019-12-18 17:33:19,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:19,497 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 17:33:19,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797541957] [2019-12-18 17:33:19,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:19,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:33:19,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366092306] [2019-12-18 17:33:19,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:33:19,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:19,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:33:19,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:33:19,499 INFO L87 Difference]: Start difference. First operand 604 states and 1406 transitions. Second operand 5 states. [2019-12-18 17:33:19,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:19,724 INFO L93 Difference]: Finished difference Result 893 states and 2078 transitions. [2019-12-18 17:33:19,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:33:19,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 17:33:19,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:19,726 INFO L225 Difference]: With dead ends: 893 [2019-12-18 17:33:19,726 INFO L226 Difference]: Without dead ends: 893 [2019-12-18 17:33:19,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:33:19,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-12-18 17:33:19,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 718. [2019-12-18 17:33:19,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-12-18 17:33:19,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1687 transitions. [2019-12-18 17:33:19,749 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1687 transitions. Word has length 55 [2019-12-18 17:33:19,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:19,749 INFO L462 AbstractCegarLoop]: Abstraction has 718 states and 1687 transitions. [2019-12-18 17:33:19,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:33:19,749 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1687 transitions. [2019-12-18 17:33:19,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:33:19,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:19,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:19,756 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:19,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:19,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1055549477, now seen corresponding path program 2 times [2019-12-18 17:33:19,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:19,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206702020] [2019-12-18 17:33:19,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:33:19,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206702020] [2019-12-18 17:33:19,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:19,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:33:19,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18759988] [2019-12-18 17:33:19,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:33:19,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:19,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:33:19,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:33:19,897 INFO L87 Difference]: Start difference. First operand 718 states and 1687 transitions. Second operand 6 states. [2019-12-18 17:33:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:20,230 INFO L93 Difference]: Finished difference Result 989 states and 2304 transitions. [2019-12-18 17:33:20,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:33:20,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 17:33:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:20,232 INFO L225 Difference]: With dead ends: 989 [2019-12-18 17:33:20,232 INFO L226 Difference]: Without dead ends: 989 [2019-12-18 17:33:20,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:33:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-12-18 17:33:20,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 780. [2019-12-18 17:33:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-12-18 17:33:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1832 transitions. [2019-12-18 17:33:20,249 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1832 transitions. Word has length 55 [2019-12-18 17:33:20,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:20,249 INFO L462 AbstractCegarLoop]: Abstraction has 780 states and 1832 transitions. [2019-12-18 17:33:20,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:33:20,249 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1832 transitions. [2019-12-18 17:33:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:33:20,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:20,251 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:20,252 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:20,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:20,252 INFO L82 PathProgramCache]: Analyzing trace with hash -2089737911, now seen corresponding path program 3 times [2019-12-18 17:33:20,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:20,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560319748] [2019-12-18 17:33:20,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:20,374 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 17:33:20,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560319748] [2019-12-18 17:33:20,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:20,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:33:20,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727167367] [2019-12-18 17:33:20,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:33:20,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:20,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:33:20,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:33:20,377 INFO L87 Difference]: Start difference. First operand 780 states and 1832 transitions. Second operand 6 states. [2019-12-18 17:33:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:20,800 INFO L93 Difference]: Finished difference Result 1297 states and 3013 transitions. [2019-12-18 17:33:20,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:33:20,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 17:33:20,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:20,802 INFO L225 Difference]: With dead ends: 1297 [2019-12-18 17:33:20,802 INFO L226 Difference]: Without dead ends: 1297 [2019-12-18 17:33:20,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:33:20,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2019-12-18 17:33:20,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 840. [2019-12-18 17:33:20,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-18 17:33:20,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1982 transitions. [2019-12-18 17:33:20,818 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1982 transitions. Word has length 55 [2019-12-18 17:33:20,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:20,819 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1982 transitions. [2019-12-18 17:33:20,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:33:20,819 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1982 transitions. [2019-12-18 17:33:20,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:33:20,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:20,822 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:20,822 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:20,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:20,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1513553193, now seen corresponding path program 4 times [2019-12-18 17:33:20,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:20,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301606927] [2019-12-18 17:33:20,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:20,887 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 17:33:20,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301606927] [2019-12-18 17:33:20,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:20,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:33:20,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919101647] [2019-12-18 17:33:20,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:33:20,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:20,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:33:20,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:33:20,891 INFO L87 Difference]: Start difference. First operand 840 states and 1982 transitions. Second operand 3 states. [2019-12-18 17:33:20,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:20,910 INFO L93 Difference]: Finished difference Result 738 states and 1699 transitions. [2019-12-18 17:33:20,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:33:20,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 17:33:20,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:20,913 INFO L225 Difference]: With dead ends: 738 [2019-12-18 17:33:20,913 INFO L226 Difference]: Without dead ends: 738 [2019-12-18 17:33:20,913 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 17:33:20,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-18 17:33:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-12-18 17:33:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-12-18 17:33:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1699 transitions. [2019-12-18 17:33:20,932 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1699 transitions. Word has length 55 [2019-12-18 17:33:20,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:20,932 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1699 transitions. [2019-12-18 17:33:20,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:33:20,933 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1699 transitions. [2019-12-18 17:33:20,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:33:20,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:20,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:20,937 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:20,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:20,937 INFO L82 PathProgramCache]: Analyzing trace with hash -272893927, now seen corresponding path program 1 times [2019-12-18 17:33:20,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:20,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938416381] [2019-12-18 17:33:20,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:21,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:33:21,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938416381] [2019-12-18 17:33:21,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:21,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:33:21,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732455647] [2019-12-18 17:33:21,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:33:21,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:21,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:33:21,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:33:21,199 INFO L87 Difference]: Start difference. First operand 738 states and 1699 transitions. Second operand 7 states. [2019-12-18 17:33:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:21,332 INFO L93 Difference]: Finished difference Result 1423 states and 3013 transitions. [2019-12-18 17:33:21,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:33:21,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-18 17:33:21,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:21,334 INFO L225 Difference]: With dead ends: 1423 [2019-12-18 17:33:21,334 INFO L226 Difference]: Without dead ends: 988 [2019-12-18 17:33:21,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:33:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2019-12-18 17:33:21,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 676. [2019-12-18 17:33:21,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-12-18 17:33:21,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1520 transitions. [2019-12-18 17:33:21,346 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1520 transitions. Word has length 56 [2019-12-18 17:33:21,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:21,347 INFO L462 AbstractCegarLoop]: Abstraction has 676 states and 1520 transitions. [2019-12-18 17:33:21,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:33:21,347 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1520 transitions. [2019-12-18 17:33:21,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:33:21,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:21,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:21,350 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:21,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:21,350 INFO L82 PathProgramCache]: Analyzing trace with hash 332964395, now seen corresponding path program 2 times [2019-12-18 17:33:21,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:21,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286705773] [2019-12-18 17:33:21,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:21,466 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 17:33:21,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286705773] [2019-12-18 17:33:21,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:21,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:33:21,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041963682] [2019-12-18 17:33:21,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:33:21,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:21,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:33:21,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:33:21,468 INFO L87 Difference]: Start difference. First operand 676 states and 1520 transitions. Second operand 6 states. [2019-12-18 17:33:21,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:21,545 INFO L93 Difference]: Finished difference Result 1071 states and 2293 transitions. [2019-12-18 17:33:21,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:33:21,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-18 17:33:21,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:21,547 INFO L225 Difference]: With dead ends: 1071 [2019-12-18 17:33:21,547 INFO L226 Difference]: Without dead ends: 384 [2019-12-18 17:33:21,547 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 17:33:21,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-12-18 17:33:21,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 336. [2019-12-18 17:33:21,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-18 17:33:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 593 transitions. [2019-12-18 17:33:21,553 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 593 transitions. Word has length 56 [2019-12-18 17:33:21,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:21,553 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 593 transitions. [2019-12-18 17:33:21,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:33:21,554 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 593 transitions. [2019-12-18 17:33:21,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:33:21,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:21,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:21,555 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:21,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:21,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1122602959, now seen corresponding path program 3 times [2019-12-18 17:33:21,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:21,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838024737] [2019-12-18 17:33:21,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:21,622 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 17:33:21,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838024737] [2019-12-18 17:33:21,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:21,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:33:21,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14703534] [2019-12-18 17:33:21,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:33:21,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:21,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:33:21,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:33:21,624 INFO L87 Difference]: Start difference. First operand 336 states and 593 transitions. Second operand 3 states. [2019-12-18 17:33:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:21,663 INFO L93 Difference]: Finished difference Result 336 states and 592 transitions. [2019-12-18 17:33:21,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:33:21,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 17:33:21,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:21,664 INFO L225 Difference]: With dead ends: 336 [2019-12-18 17:33:21,664 INFO L226 Difference]: Without dead ends: 336 [2019-12-18 17:33:21,664 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 17:33:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-18 17:33:21,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 209. [2019-12-18 17:33:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-18 17:33:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 361 transitions. [2019-12-18 17:33:21,669 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 361 transitions. Word has length 56 [2019-12-18 17:33:21,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:21,670 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 361 transitions. [2019-12-18 17:33:21,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:33:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 361 transitions. [2019-12-18 17:33:21,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:33:21,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:21,673 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:21,674 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:21,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:21,674 INFO L82 PathProgramCache]: Analyzing trace with hash -876750572, now seen corresponding path program 1 times [2019-12-18 17:33:21,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:21,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966339581] [2019-12-18 17:33:21,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:33:22,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966339581] [2019-12-18 17:33:22,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:22,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:33:22,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142363177] [2019-12-18 17:33:22,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:33:22,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:22,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:33:22,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:33:22,012 INFO L87 Difference]: Start difference. First operand 209 states and 361 transitions. Second operand 13 states. [2019-12-18 17:33:22,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:22,490 INFO L93 Difference]: Finished difference Result 370 states and 622 transitions. [2019-12-18 17:33:22,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 17:33:22,490 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 17:33:22,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:22,491 INFO L225 Difference]: With dead ends: 370 [2019-12-18 17:33:22,491 INFO L226 Difference]: Without dead ends: 335 [2019-12-18 17:33:22,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2019-12-18 17:33:22,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-12-18 17:33:22,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 317. [2019-12-18 17:33:22,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-18 17:33:22,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 546 transitions. [2019-12-18 17:33:22,501 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 546 transitions. Word has length 57 [2019-12-18 17:33:22,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:22,502 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 546 transitions. [2019-12-18 17:33:22,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:33:22,502 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 546 transitions. [2019-12-18 17:33:22,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:33:22,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:22,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:22,508 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:22,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:22,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1963724718, now seen corresponding path program 2 times [2019-12-18 17:33:22,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:22,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231259066] [2019-12-18 17:33:22,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:33:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:33:22,674 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:33:22,676 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:33:22,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~y$w_buff0~0_225) (= v_~x~0_72 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_30 0) (= 0 v_~__unbuffered_cnt~0_82) (= v_~y$w_buff1_used~0_382 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~__unbuffered_p2_EBX~0_120 0) (= 0 v_~y$r_buff1_thd2~0_163) (= v_~y$r_buff1_thd1~0_106 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1202~0.base_25| 1) |v_#valid_62|) (< 0 |v_#StackHeapBarrier_17|) (= |v_ULTIMATE.start_main_~#t1202~0.offset_19| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1202~0.base_25| 4)) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~y$r_buff0_thd3~0_195) (= 0 v_~y$r_buff0_thd2~0_108) (= 0 v_~y$flush_delayed~0_58) (= 0 |v_#NULL.base_6|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1202~0.base_25|)) (= v_~z~0_106 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$w_buff1~0_183 0) (= v_~y$mem_tmp~0_20 0) (= 0 v_~__unbuffered_p2_EAX~0_120) (= v_~main$tmp_guard1~0_32 0) (= 0 v_~weak$$choice0~0_16) (= v_~a~0_45 0) (= v_~y~0_155 0) (= 0 v_~y$r_buff1_thd3~0_156) (= v_~y$r_buff0_thd0~0_325 0) (= v_~weak$$choice2~0_108 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1202~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1202~0.base_25|) |v_ULTIMATE.start_main_~#t1202~0.offset_19| 0)) |v_#memory_int_21|) (= v_~y$r_buff1_thd0~0_281 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1202~0.base_25|) (= v_~y$w_buff0_used~0_625 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_37|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_22|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_28|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_45|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_26|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_45|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_45, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_156, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y$flush_delayed~0=v_~y$flush_delayed~0_58, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_120, ULTIMATE.start_main_~#t1204~0.base=|v_ULTIMATE.start_main_~#t1204~0.base_25|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_120, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_26|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_24|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_48|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_68|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_183, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_281, ~x~0=v_~x~0_72, ULTIMATE.start_main_~#t1204~0.offset=|v_ULTIMATE.start_main_~#t1204~0.offset_19|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_625, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_41|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_67|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_28|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_106|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_33|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_38|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_53|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_106, ULTIMATE.start_main_~#t1202~0.base=|v_ULTIMATE.start_main_~#t1202~0.base_25|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_24|, ~y$w_buff0~0=v_~y$w_buff0~0_225, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_195, ~y~0=v_~y~0_155, ULTIMATE.start_main_~#t1203~0.base=|v_ULTIMATE.start_main_~#t1203~0.base_25|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_28|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_48|, ULTIMATE.start_main_~#t1203~0.offset=|v_ULTIMATE.start_main_~#t1203~0.offset_19|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_163, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_325, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_106, ~weak$$choice2~0=v_~weak$$choice2~0_108, ULTIMATE.start_main_~#t1202~0.offset=|v_ULTIMATE.start_main_~#t1202~0.offset_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_382} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1204~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1204~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t1202~0.base, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1203~0.base, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1203~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1202~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 17:33:22,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L810-1-->L812: Formula: (and (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1203~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1203~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1203~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1203~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1203~0.base_13|) |v_ULTIMATE.start_main_~#t1203~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1203~0.base_13| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1203~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1203~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1203~0.base=|v_ULTIMATE.start_main_~#t1203~0.base_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1203~0.offset=|v_ULTIMATE.start_main_~#t1203~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1203~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1203~0.offset] because there is no mapped edge [2019-12-18 17:33:22,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L812-1-->L814: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1204~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1204~0.base_13|) |v_ULTIMATE.start_main_~#t1204~0.offset_11| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1204~0.base_13|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1204~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1204~0.offset_11| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1204~0.base_13| 4)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1204~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1204~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1204~0.offset=|v_ULTIMATE.start_main_~#t1204~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1204~0.base=|v_ULTIMATE.start_main_~#t1204~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1204~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1204~0.base] because there is no mapped edge [2019-12-18 17:33:22,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] P2ENTRY-->L4-3: Formula: (and (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|) (= v_~y$w_buff0~0_33 v_~y$w_buff1~0_29) (= v_~y$w_buff0_used~0_130 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_12| v_P2Thread1of1ForFork0_~arg.base_12) (= 0 (mod v_~y$w_buff1_used~0_75 256)) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|) (= 2 v_~y$w_buff0~0_32) (= v_~y$w_buff1_used~0_75 v_~y$w_buff0_used~0_131) (= |v_P2Thread1of1ForFork0_#in~arg.offset_12| v_P2Thread1of1ForFork0_~arg.offset_12)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_12|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_131, ~y$w_buff0~0=v_~y$w_buff0~0_33, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_12|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_12, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_12|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_32, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_12, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_12|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 17:33:22,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15) (= v_~a~0_29 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_~x~0_52 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{~a~0=v_~a~0_29, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_52, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 17:33:22,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1065028091 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1065028091 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite11_Out-1065028091|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1065028091 |P2Thread1of1ForFork0_#t~ite11_Out-1065028091|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1065028091, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1065028091} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1065028091, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-1065028091|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1065028091} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 17:33:22,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1319799847 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1319799847 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1319799847 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1319799847 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite12_Out1319799847| ~y$w_buff1_used~0_In1319799847) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite12_Out1319799847| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1319799847, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1319799847, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1319799847, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1319799847} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1319799847, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1319799847, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1319799847|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1319799847, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1319799847} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 17:33:22,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L790-->L791: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-141636387 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-141636387 256)))) (or (and (= ~y$r_buff0_thd3~0_In-141636387 ~y$r_buff0_thd3~0_Out-141636387) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out-141636387)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-141636387, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-141636387} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-141636387, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-141636387, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-141636387|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 17:33:22,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1464732998 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1464732998 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-1464732998 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1464732998 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-1464732998 |P2Thread1of1ForFork0_#t~ite14_Out-1464732998|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite14_Out-1464732998|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1464732998, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1464732998, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1464732998, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1464732998} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-1464732998|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1464732998, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1464732998, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1464732998, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1464732998} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 17:33:22,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L791-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_28| v_~y$r_buff1_thd3~0_94) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_27|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_94, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 17:33:22,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L752-2-->L752-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In949349969 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In949349969 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite3_Out949349969| ~y~0_In949349969) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite3_Out949349969| ~y$w_buff1~0_In949349969) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In949349969, ~y$w_buff1~0=~y$w_buff1~0_In949349969, ~y~0=~y~0_In949349969, ~y$w_buff1_used~0=~y$w_buff1_used~0_In949349969} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In949349969, ~y$w_buff1~0=~y$w_buff1~0_In949349969, ~y~0=~y~0_In949349969, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out949349969|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In949349969} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 17:33:22,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L752-4-->L753: Formula: (= v_~y~0_39 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_9|, ~y~0=v_~y~0_39, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 17:33:22,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L753-->L753-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In693011675 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In693011675 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite5_Out693011675| ~y$w_buff0_used~0_In693011675)) (and (= 0 |P1Thread1of1ForFork2_#t~ite5_Out693011675|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In693011675, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In693011675} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In693011675, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In693011675, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out693011675|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 17:33:22,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L754-->L754-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1909740979 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1909740979 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1909740979 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1909740979 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite6_Out1909740979| 0)) (and (= |P1Thread1of1ForFork2_#t~ite6_Out1909740979| ~y$w_buff1_used~0_In1909740979) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1909740979, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1909740979, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1909740979, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1909740979} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1909740979, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1909740979, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1909740979, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out1909740979|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1909740979} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 17:33:22,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-102104763 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-102104763 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite7_Out-102104763| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-102104763 |P1Thread1of1ForFork2_#t~ite7_Out-102104763|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-102104763, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-102104763} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-102104763, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-102104763, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-102104763|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 17:33:22,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L756-->L756-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1552478256 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1552478256 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1552478256 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1552478256 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite8_Out-1552478256| ~y$r_buff1_thd2~0_In-1552478256) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite8_Out-1552478256| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1552478256, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1552478256, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1552478256, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1552478256} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1552478256, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1552478256, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1552478256|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1552478256, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1552478256} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:33:22,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L756-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P1Thread1of1ForFork2_#t~ite8_30| v_~y$r_buff1_thd2~0_111) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_111, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 17:33:22,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L814-1-->L820: Formula: (and (= v_~main$tmp_guard0~0_11 1) (= 3 v_~__unbuffered_cnt~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:33:22,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-2-->L820-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1035164537 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1035164537 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out-1035164537| |ULTIMATE.start_main_#t~ite18_Out-1035164537|))) (or (and (= ~y~0_In-1035164537 |ULTIMATE.start_main_#t~ite18_Out-1035164537|) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite18_Out-1035164537| ~y$w_buff1~0_In-1035164537) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1035164537, ~y~0=~y~0_In-1035164537, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1035164537, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1035164537} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1035164537, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1035164537|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1035164537|, ~y~0=~y~0_In-1035164537, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1035164537, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1035164537} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 17:33:22,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1935655808 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1935655808 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out1935655808|)) (and (= ~y$w_buff0_used~0_In1935655808 |ULTIMATE.start_main_#t~ite20_Out1935655808|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1935655808, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1935655808} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1935655808, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1935655808, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1935655808|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:33:22,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In2057083890 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2057083890 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In2057083890 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In2057083890 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In2057083890 |ULTIMATE.start_main_#t~ite21_Out2057083890|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite21_Out2057083890| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2057083890, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2057083890, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2057083890, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2057083890} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2057083890, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2057083890, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out2057083890|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2057083890, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2057083890} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:33:22,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-405857885 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-405857885 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-405857885| ~y$r_buff0_thd0~0_In-405857885)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite22_Out-405857885|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-405857885, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-405857885} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-405857885, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-405857885, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-405857885|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:33:22,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-2040796345 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2040796345 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-2040796345 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2040796345 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite23_Out-2040796345|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In-2040796345 |ULTIMATE.start_main_#t~ite23_Out-2040796345|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2040796345, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2040796345, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2040796345, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2040796345} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2040796345, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2040796345, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2040796345, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-2040796345|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2040796345} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 17:33:22,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L833-->L833-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1770968794 256) 0))) (or (and .cse0 (= ~y$w_buff1~0_In1770968794 |ULTIMATE.start_main_#t~ite32_Out1770968794|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1770968794 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In1770968794 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd0~0_In1770968794 256)) .cse1) (= (mod ~y$w_buff0_used~0_In1770968794 256) 0))) (= |ULTIMATE.start_main_#t~ite33_Out1770968794| |ULTIMATE.start_main_#t~ite32_Out1770968794|)) (and (= ~y$w_buff1~0_In1770968794 |ULTIMATE.start_main_#t~ite33_Out1770968794|) (not .cse0) (= |ULTIMATE.start_main_#t~ite32_In1770968794| |ULTIMATE.start_main_#t~ite32_Out1770968794|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1770968794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1770968794, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1770968794, ~weak$$choice2~0=~weak$$choice2~0_In1770968794, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1770968794, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In1770968794|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1770968794} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1770968794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1770968794, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1770968794, ~weak$$choice2~0=~weak$$choice2~0_In1770968794, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out1770968794|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1770968794, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out1770968794|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1770968794} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-18 17:33:22,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L834-->L834-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-31789704 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-31789704 256) 0))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-31789704 256))) (= 0 (mod ~y$w_buff0_used~0_In-31789704 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-31789704 256)) .cse0))) (= |ULTIMATE.start_main_#t~ite36_Out-31789704| |ULTIMATE.start_main_#t~ite35_Out-31789704|) .cse1 (= |ULTIMATE.start_main_#t~ite35_Out-31789704| ~y$w_buff0_used~0_In-31789704)) (and (= |ULTIMATE.start_main_#t~ite35_In-31789704| |ULTIMATE.start_main_#t~ite35_Out-31789704|) (= |ULTIMATE.start_main_#t~ite36_Out-31789704| ~y$w_buff0_used~0_In-31789704) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-31789704, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-31789704, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-31789704|, ~weak$$choice2~0=~weak$$choice2~0_In-31789704, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-31789704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-31789704} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-31789704, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-31789704, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-31789704|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-31789704|, ~weak$$choice2~0=~weak$$choice2~0_In-31789704, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-31789704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-31789704} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 17:33:22,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L835-->L835-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1280644344 256)))) (or (and .cse0 (= ~y$w_buff1_used~0_In1280644344 |ULTIMATE.start_main_#t~ite38_Out1280644344|) (= |ULTIMATE.start_main_#t~ite38_Out1280644344| |ULTIMATE.start_main_#t~ite39_Out1280644344|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1280644344 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In1280644344 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In1280644344 256) 0) (and (= 0 (mod ~y$r_buff1_thd0~0_In1280644344 256)) .cse1)))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In1280644344| |ULTIMATE.start_main_#t~ite38_Out1280644344|) (= ~y$w_buff1_used~0_In1280644344 |ULTIMATE.start_main_#t~ite39_Out1280644344|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1280644344, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1280644344, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In1280644344|, ~weak$$choice2~0=~weak$$choice2~0_In1280644344, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1280644344, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1280644344} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1280644344, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1280644344|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1280644344, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1280644344|, ~weak$$choice2~0=~weak$$choice2~0_In1280644344, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1280644344, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1280644344} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 17:33:22,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L836-->L837: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_29 256))) (= v_~y$r_buff0_thd0~0_100 v_~y$r_buff0_thd0~0_99)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_99, ~weak$$choice2~0=v_~weak$$choice2~0_29, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:33:22,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L839-->L4: Formula: (and (= v_~y~0_138 v_~y$mem_tmp~0_17) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 0 v_~y$flush_delayed~0_52) (not (= (mod v_~y$flush_delayed~0_53 256) 0))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_53, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_17, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_52, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~y~0=v_~y~0_138, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:33:22,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} 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_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 17:33:22,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:33:22 BasicIcfg [2019-12-18 17:33:22,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:33:22,844 INFO L168 Benchmark]: Toolchain (without parser) took 18075.52 ms. Allocated memory was 138.9 MB in the beginning and 840.4 MB in the end (delta: 701.5 MB). Free memory was 101.0 MB in the beginning and 309.2 MB in the end (delta: -208.2 MB). Peak memory consumption was 493.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:33:22,844 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 17:33:22,845 INFO L168 Benchmark]: CACSL2BoogieTranslator took 738.51 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.6 MB in the beginning and 156.4 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:33:22,846 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.93 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:33:22,847 INFO L168 Benchmark]: Boogie Preprocessor took 41.58 ms. Allocated memory is still 202.9 MB. Free memory was 153.8 MB in the beginning and 151.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:33:22,848 INFO L168 Benchmark]: RCFGBuilder took 815.67 ms. Allocated memory is still 202.9 MB. Free memory was 151.2 MB in the beginning and 104.3 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:33:22,852 INFO L168 Benchmark]: TraceAbstraction took 16398.33 ms. Allocated memory was 202.9 MB in the beginning and 840.4 MB in the end (delta: 637.5 MB). Free memory was 104.3 MB in the beginning and 309.2 MB in the end (delta: -204.9 MB). Peak memory consumption was 432.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:33:22,858 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 738.51 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.6 MB in the beginning and 156.4 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.93 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.58 ms. Allocated memory is still 202.9 MB. Free memory was 153.8 MB in the beginning and 151.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 815.67 ms. Allocated memory is still 202.9 MB. Free memory was 151.2 MB in the beginning and 104.3 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16398.33 ms. Allocated memory was 202.9 MB in the beginning and 840.4 MB in the end (delta: 637.5 MB). Free memory was 104.3 MB in the beginning and 309.2 MB in the end (delta: -204.9 MB). Peak memory consumption was 432.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 91 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 39 ConcurrentYvCompositions, 26 ChoiceCompositions, 4376 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 58 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 46792 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1202, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t1203, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1204, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L772] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L773] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L774] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L775] 3 y$r_buff0_thd3 = (_Bool)1 [L778] 3 z = 1 [L781] 3 __unbuffered_p2_EAX = z [L784] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 2 [L749] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L752] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 y$flush_delayed = weak$$choice2 [L830] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L832] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L833] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L834] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L835] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L837] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1479 SDtfs, 1266 SDslu, 2932 SDs, 0 SdLazy, 1391 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 28 SyntacticMatches, 11 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22284occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 3526 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 685 NumberOfCodeBlocks, 685 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 613 ConstructedInterpolants, 0 QuantifiedInterpolants, 109047 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...