/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:38:43,397 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:38:43,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:38:43,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:38:43,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:38:43,417 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:38:43,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:38:43,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:38:43,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:38:43,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:38:43,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:38:43,439 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:38:43,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:38:43,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:38:43,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:38:43,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:38:43,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:38:43,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:38:43,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:38:43,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:38:43,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:38:43,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:38:43,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:38:43,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:38:43,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:38:43,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:38:43,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:38:43,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:38:43,469 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:38:43,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:38:43,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:38:43,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:38:43,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:38:43,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:38:43,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:38:43,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:38:43,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:38:43,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:38:43,476 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:38:43,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:38:43,478 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:38:43,478 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:38:43,504 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:38:43,504 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:38:43,505 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:38:43,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:38:43,506 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:38:43,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:38:43,510 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:38:43,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:38:43,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:38:43,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:38:43,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:38:43,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:38:43,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:38:43,511 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:38:43,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:38:43,512 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:38:43,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:38:43,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:38:43,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:38:43,513 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:38:43,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:38:43,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:38:43,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:38:43,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:38:43,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:38:43,514 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:38:43,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:38:43,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:38:43,515 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:38:43,515 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:38:43,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:38:43,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:38:43,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:38:43,808 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:38:43,808 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:38:43,809 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_rmo.opt.i [2019-12-18 14:38:43,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb8a4a2cd/52c8a0eee9994cfaa0d0f15fdb4b8e3b/FLAGeab57fdfd [2019-12-18 14:38:44,463 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:38:44,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_rmo.opt.i [2019-12-18 14:38:44,480 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb8a4a2cd/52c8a0eee9994cfaa0d0f15fdb4b8e3b/FLAGeab57fdfd [2019-12-18 14:38:44,694 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb8a4a2cd/52c8a0eee9994cfaa0d0f15fdb4b8e3b [2019-12-18 14:38:44,704 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:38:44,706 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:38:44,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:38:44,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:38:44,711 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:38:44,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:38:44" (1/1) ... [2019-12-18 14:38:44,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45be7259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:44, skipping insertion in model container [2019-12-18 14:38:44,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:38:44" (1/1) ... [2019-12-18 14:38:44,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:38:44,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:38:45,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:38:45,353 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:38:45,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:38:45,487 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:38:45,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:45 WrapperNode [2019-12-18 14:38:45,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:38:45,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:38:45,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:38:45,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:38:45,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:45" (1/1) ... [2019-12-18 14:38:45,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:45" (1/1) ... [2019-12-18 14:38:45,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:38:45,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:38:45,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:38:45,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:38:45,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:45" (1/1) ... [2019-12-18 14:38:45,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:45" (1/1) ... [2019-12-18 14:38:45,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:45" (1/1) ... [2019-12-18 14:38:45,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:45" (1/1) ... [2019-12-18 14:38:45,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:45" (1/1) ... [2019-12-18 14:38:45,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:45" (1/1) ... [2019-12-18 14:38:45,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:45" (1/1) ... [2019-12-18 14:38:45,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:38:45,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:38:45,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:38:45,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:38:45,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:45" (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 14:38:45,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:38:45,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:38:45,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:38:45,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:38:45,664 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:38:45,664 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:38:45,664 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:38:45,665 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:38:45,665 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:38:45,665 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:38:45,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:38:45,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:38:45,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:38:45,667 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 14:38:46,374 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:38:46,374 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:38:46,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:38:46 BoogieIcfgContainer [2019-12-18 14:38:46,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:38:46,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:38:46,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:38:46,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:38:46,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:38:44" (1/3) ... [2019-12-18 14:38:46,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b479488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:38:46, skipping insertion in model container [2019-12-18 14:38:46,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:45" (2/3) ... [2019-12-18 14:38:46,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b479488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:38:46, skipping insertion in model container [2019-12-18 14:38:46,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:38:46" (3/3) ... [2019-12-18 14:38:46,384 INFO L109 eAbstractionObserver]: Analyzing ICFG safe012_rmo.opt.i [2019-12-18 14:38:46,394 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:38:46,395 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:38:46,408 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:38:46,409 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:38:46,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,473 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,474 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,532 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,532 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,533 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,533 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,533 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,541 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,541 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,553 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,553 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,553 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,561 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,561 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,565 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,566 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:46,584 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:38:46,607 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:38:46,607 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:38:46,607 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:38:46,607 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:38:46,608 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:38:46,608 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:38:46,608 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:38:46,608 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:38:46,622 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 14:38:46,624 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 14:38:46,721 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 14:38:46,722 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:38:46,744 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 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:38:46,767 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 14:38:46,834 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 14:38:46,834 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:38:46,842 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 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:38:46,861 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 14:38:46,863 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:38:50,639 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-12-18 14:38:52,413 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 14:38:52,539 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 14:38:52,651 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64821 [2019-12-18 14:38:52,651 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 14:38:52,655 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 89 transitions [2019-12-18 14:39:02,495 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80192 states. [2019-12-18 14:39:02,498 INFO L276 IsEmpty]: Start isEmpty. Operand 80192 states. [2019-12-18 14:39:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:39:02,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:02,505 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:39:02,506 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:02,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:02,512 INFO L82 PathProgramCache]: Analyzing trace with hash 801165869, now seen corresponding path program 1 times [2019-12-18 14:39:02,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:02,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573039034] [2019-12-18 14:39:02,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:02,738 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 14:39:02,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573039034] [2019-12-18 14:39:02,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:02,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:39:02,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594551727] [2019-12-18 14:39:02,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:39:02,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:02,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:39:02,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:39:02,764 INFO L87 Difference]: Start difference. First operand 80192 states. Second operand 3 states. [2019-12-18 14:39:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:03,555 INFO L93 Difference]: Finished difference Result 79136 states and 341584 transitions. [2019-12-18 14:39:03,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:39:03,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:39:03,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:06,272 INFO L225 Difference]: With dead ends: 79136 [2019-12-18 14:39:06,273 INFO L226 Difference]: Without dead ends: 74600 [2019-12-18 14:39:06,275 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 14:39:08,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74600 states. [2019-12-18 14:39:11,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74600 to 74600. [2019-12-18 14:39:11,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74600 states. [2019-12-18 14:39:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74600 states to 74600 states and 321550 transitions. [2019-12-18 14:39:11,734 INFO L78 Accepts]: Start accepts. Automaton has 74600 states and 321550 transitions. Word has length 5 [2019-12-18 14:39:11,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:11,735 INFO L462 AbstractCegarLoop]: Abstraction has 74600 states and 321550 transitions. [2019-12-18 14:39:11,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:39:11,735 INFO L276 IsEmpty]: Start isEmpty. Operand 74600 states and 321550 transitions. [2019-12-18 14:39:11,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:39:11,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:11,744 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:11,744 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:11,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:11,745 INFO L82 PathProgramCache]: Analyzing trace with hash 144866957, now seen corresponding path program 1 times [2019-12-18 14:39:11,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:11,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195788256] [2019-12-18 14:39:11,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:11,861 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 14:39:11,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195788256] [2019-12-18 14:39:11,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:11,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:39:11,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871331436] [2019-12-18 14:39:11,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:39:11,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:11,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:39:11,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:39:11,865 INFO L87 Difference]: Start difference. First operand 74600 states and 321550 transitions. Second operand 4 states. [2019-12-18 14:39:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:16,446 INFO L93 Difference]: Finished difference Result 114840 states and 473340 transitions. [2019-12-18 14:39:16,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:39:16,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:39:16,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:17,013 INFO L225 Difference]: With dead ends: 114840 [2019-12-18 14:39:17,014 INFO L226 Difference]: Without dead ends: 114749 [2019-12-18 14:39:17,014 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 14:39:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114749 states. [2019-12-18 14:39:22,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114749 to 106549. [2019-12-18 14:39:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106549 states. [2019-12-18 14:39:23,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106549 states to 106549 states and 443513 transitions. [2019-12-18 14:39:23,734 INFO L78 Accepts]: Start accepts. Automaton has 106549 states and 443513 transitions. Word has length 13 [2019-12-18 14:39:23,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:23,735 INFO L462 AbstractCegarLoop]: Abstraction has 106549 states and 443513 transitions. [2019-12-18 14:39:23,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:39:23,735 INFO L276 IsEmpty]: Start isEmpty. Operand 106549 states and 443513 transitions. [2019-12-18 14:39:23,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:39:23,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:23,739 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:23,739 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:23,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:23,739 INFO L82 PathProgramCache]: Analyzing trace with hash 483707300, now seen corresponding path program 1 times [2019-12-18 14:39:23,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:23,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275473524] [2019-12-18 14:39:23,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:23,843 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 14:39:23,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275473524] [2019-12-18 14:39:23,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:23,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:39:23,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474970893] [2019-12-18 14:39:23,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:39:23,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:23,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:39:23,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:39:23,846 INFO L87 Difference]: Start difference. First operand 106549 states and 443513 transitions. Second operand 4 states. [2019-12-18 14:39:24,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:24,839 INFO L93 Difference]: Finished difference Result 148763 states and 604775 transitions. [2019-12-18 14:39:24,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:39:24,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:39:24,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:30,221 INFO L225 Difference]: With dead ends: 148763 [2019-12-18 14:39:30,221 INFO L226 Difference]: Without dead ends: 148659 [2019-12-18 14:39:30,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:39:33,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148659 states. [2019-12-18 14:39:35,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148659 to 126910. [2019-12-18 14:39:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126910 states. [2019-12-18 14:39:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126910 states to 126910 states and 524476 transitions. [2019-12-18 14:39:35,921 INFO L78 Accepts]: Start accepts. Automaton has 126910 states and 524476 transitions. Word has length 13 [2019-12-18 14:39:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:35,922 INFO L462 AbstractCegarLoop]: Abstraction has 126910 states and 524476 transitions. [2019-12-18 14:39:35,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:39:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 126910 states and 524476 transitions. [2019-12-18 14:39:35,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:39:35,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:35,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:35,926 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:35,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:35,927 INFO L82 PathProgramCache]: Analyzing trace with hash 145051196, now seen corresponding path program 1 times [2019-12-18 14:39:35,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:35,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385734857] [2019-12-18 14:39:35,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:36,062 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 14:39:36,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385734857] [2019-12-18 14:39:36,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:36,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:39:36,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289779920] [2019-12-18 14:39:36,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:39:36,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:36,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:39:36,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:39:36,065 INFO L87 Difference]: Start difference. First operand 126910 states and 524476 transitions. Second operand 5 states. [2019-12-18 14:39:38,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:38,302 INFO L93 Difference]: Finished difference Result 172949 states and 700308 transitions. [2019-12-18 14:39:38,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:39:38,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 14:39:38,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:38,830 INFO L225 Difference]: With dead ends: 172949 [2019-12-18 14:39:38,830 INFO L226 Difference]: Without dead ends: 172813 [2019-12-18 14:39:38,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:39:47,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172813 states. [2019-12-18 14:39:49,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172813 to 134187. [2019-12-18 14:39:49,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134187 states. [2019-12-18 14:39:51,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134187 states to 134187 states and 553595 transitions. [2019-12-18 14:39:51,090 INFO L78 Accepts]: Start accepts. Automaton has 134187 states and 553595 transitions. Word has length 14 [2019-12-18 14:39:51,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:51,090 INFO L462 AbstractCegarLoop]: Abstraction has 134187 states and 553595 transitions. [2019-12-18 14:39:51,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:39:51,091 INFO L276 IsEmpty]: Start isEmpty. Operand 134187 states and 553595 transitions. [2019-12-18 14:39:51,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 14:39:51,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:51,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:51,113 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:51,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:51,114 INFO L82 PathProgramCache]: Analyzing trace with hash -448648622, now seen corresponding path program 1 times [2019-12-18 14:39:51,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:51,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245528935] [2019-12-18 14:39:51,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:51,174 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 14:39:51,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245528935] [2019-12-18 14:39:51,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:51,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:39:51,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154737526] [2019-12-18 14:39:51,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:39:51,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:51,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:39:51,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:39:51,177 INFO L87 Difference]: Start difference. First operand 134187 states and 553595 transitions. Second operand 3 states. [2019-12-18 14:39:51,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:51,885 INFO L93 Difference]: Finished difference Result 133799 states and 552073 transitions. [2019-12-18 14:39:51,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:39:51,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 14:39:51,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:52,277 INFO L225 Difference]: With dead ends: 133799 [2019-12-18 14:39:52,277 INFO L226 Difference]: Without dead ends: 133799 [2019-12-18 14:39:52,277 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 14:40:00,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133799 states. [2019-12-18 14:40:02,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133799 to 133799. [2019-12-18 14:40:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133799 states. [2019-12-18 14:40:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133799 states to 133799 states and 552073 transitions. [2019-12-18 14:40:04,091 INFO L78 Accepts]: Start accepts. Automaton has 133799 states and 552073 transitions. Word has length 18 [2019-12-18 14:40:04,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:04,091 INFO L462 AbstractCegarLoop]: Abstraction has 133799 states and 552073 transitions. [2019-12-18 14:40:04,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:40:04,092 INFO L276 IsEmpty]: Start isEmpty. Operand 133799 states and 552073 transitions. [2019-12-18 14:40:04,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:40:04,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:04,114 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:40:04,115 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:04,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:04,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1144737546, now seen corresponding path program 1 times [2019-12-18 14:40:04,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:04,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579347108] [2019-12-18 14:40:04,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:04,171 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 14:40:04,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579347108] [2019-12-18 14:40:04,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:04,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:40:04,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013276556] [2019-12-18 14:40:04,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:40:04,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:04,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:40:04,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:40:04,174 INFO L87 Difference]: Start difference. First operand 133799 states and 552073 transitions. Second operand 4 states. [2019-12-18 14:40:05,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:05,450 INFO L93 Difference]: Finished difference Result 243998 states and 1008264 transitions. [2019-12-18 14:40:05,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:40:05,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 14:40:05,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:12,470 INFO L225 Difference]: With dead ends: 243998 [2019-12-18 14:40:12,470 INFO L226 Difference]: Without dead ends: 133380 [2019-12-18 14:40:12,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 14:40:15,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133380 states. [2019-12-18 14:40:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133380 to 132604. [2019-12-18 14:40:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132604 states. [2019-12-18 14:40:17,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132604 states to 132604 states and 541797 transitions. [2019-12-18 14:40:17,971 INFO L78 Accepts]: Start accepts. Automaton has 132604 states and 541797 transitions. Word has length 19 [2019-12-18 14:40:17,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:17,971 INFO L462 AbstractCegarLoop]: Abstraction has 132604 states and 541797 transitions. [2019-12-18 14:40:17,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:40:17,971 INFO L276 IsEmpty]: Start isEmpty. Operand 132604 states and 541797 transitions. [2019-12-18 14:40:17,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:40:17,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:17,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:40:17,987 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:17,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:17,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1997587133, now seen corresponding path program 1 times [2019-12-18 14:40:17,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:17,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623548262] [2019-12-18 14:40:17,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:18,061 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 14:40:18,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623548262] [2019-12-18 14:40:18,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:18,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:40:18,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462568829] [2019-12-18 14:40:18,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:40:18,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:18,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:40:18,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:40:18,063 INFO L87 Difference]: Start difference. First operand 132604 states and 541797 transitions. Second operand 5 states. [2019-12-18 14:40:20,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:20,421 INFO L93 Difference]: Finished difference Result 182821 states and 731119 transitions. [2019-12-18 14:40:20,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:40:20,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 14:40:20,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:26,696 INFO L225 Difference]: With dead ends: 182821 [2019-12-18 14:40:26,696 INFO L226 Difference]: Without dead ends: 181141 [2019-12-18 14:40:26,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:40:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181141 states. [2019-12-18 14:40:32,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181141 to 137168. [2019-12-18 14:40:32,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137168 states. [2019-12-18 14:40:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137168 states to 137168 states and 559766 transitions. [2019-12-18 14:40:33,342 INFO L78 Accepts]: Start accepts. Automaton has 137168 states and 559766 transitions. Word has length 19 [2019-12-18 14:40:33,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:33,343 INFO L462 AbstractCegarLoop]: Abstraction has 137168 states and 559766 transitions. [2019-12-18 14:40:33,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:40:33,343 INFO L276 IsEmpty]: Start isEmpty. Operand 137168 states and 559766 transitions. [2019-12-18 14:40:33,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 14:40:33,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:33,365 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] [2019-12-18 14:40:33,365 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:33,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:33,366 INFO L82 PathProgramCache]: Analyzing trace with hash 826616842, now seen corresponding path program 1 times [2019-12-18 14:40:33,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:33,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115292958] [2019-12-18 14:40:33,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:40:33,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115292958] [2019-12-18 14:40:33,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:33,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:40:33,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184918131] [2019-12-18 14:40:33,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:40:33,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:33,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:40:33,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:40:33,427 INFO L87 Difference]: Start difference. First operand 137168 states and 559766 transitions. Second operand 4 states. [2019-12-18 14:40:39,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:39,731 INFO L93 Difference]: Finished difference Result 208641 states and 859416 transitions. [2019-12-18 14:40:39,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:40:39,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-18 14:40:39,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:40,011 INFO L225 Difference]: With dead ends: 208641 [2019-12-18 14:40:40,011 INFO L226 Difference]: Without dead ends: 95129 [2019-12-18 14:40:40,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 14:40:42,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95129 states. [2019-12-18 14:40:44,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95129 to 88607. [2019-12-18 14:40:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88607 states. [2019-12-18 14:40:44,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88607 states to 88607 states and 363903 transitions. [2019-12-18 14:40:44,612 INFO L78 Accepts]: Start accepts. Automaton has 88607 states and 363903 transitions. Word has length 20 [2019-12-18 14:40:44,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:44,612 INFO L462 AbstractCegarLoop]: Abstraction has 88607 states and 363903 transitions. [2019-12-18 14:40:44,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:40:44,613 INFO L276 IsEmpty]: Start isEmpty. Operand 88607 states and 363903 transitions. [2019-12-18 14:40:44,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 14:40:44,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:44,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:40:44,629 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:44,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:44,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1336681809, now seen corresponding path program 1 times [2019-12-18 14:40:44,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:44,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828414294] [2019-12-18 14:40:44,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:44,691 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 14:40:44,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828414294] [2019-12-18 14:40:44,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:44,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:40:44,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140527967] [2019-12-18 14:40:44,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:40:44,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:44,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:40:44,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:40:44,694 INFO L87 Difference]: Start difference. First operand 88607 states and 363903 transitions. Second operand 3 states. [2019-12-18 14:40:45,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:45,333 INFO L93 Difference]: Finished difference Result 84552 states and 342415 transitions. [2019-12-18 14:40:45,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:40:45,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 14:40:45,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:46,522 INFO L225 Difference]: With dead ends: 84552 [2019-12-18 14:40:46,522 INFO L226 Difference]: Without dead ends: 84552 [2019-12-18 14:40:46,522 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 14:40:48,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84552 states. [2019-12-18 14:40:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84552 to 84552. [2019-12-18 14:40:53,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84552 states. [2019-12-18 14:40:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84552 states to 84552 states and 342415 transitions. [2019-12-18 14:40:54,323 INFO L78 Accepts]: Start accepts. Automaton has 84552 states and 342415 transitions. Word has length 21 [2019-12-18 14:40:54,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:54,324 INFO L462 AbstractCegarLoop]: Abstraction has 84552 states and 342415 transitions. [2019-12-18 14:40:54,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:40:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 84552 states and 342415 transitions. [2019-12-18 14:40:54,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:40:54,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:54,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:40:54,339 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:54,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:54,340 INFO L82 PathProgramCache]: Analyzing trace with hash 120078242, now seen corresponding path program 1 times [2019-12-18 14:40:54,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:54,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100129692] [2019-12-18 14:40:54,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:54,404 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 14:40:54,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100129692] [2019-12-18 14:40:54,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:54,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:40:54,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382892925] [2019-12-18 14:40:54,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:40:54,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:54,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:40:54,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:40:54,406 INFO L87 Difference]: Start difference. First operand 84552 states and 342415 transitions. Second operand 4 states. [2019-12-18 14:40:54,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:54,518 INFO L93 Difference]: Finished difference Result 20359 states and 70599 transitions. [2019-12-18 14:40:54,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:40:54,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-18 14:40:54,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:54,549 INFO L225 Difference]: With dead ends: 20359 [2019-12-18 14:40:54,550 INFO L226 Difference]: Without dead ends: 16394 [2019-12-18 14:40:54,550 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 14:40:54,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16394 states. [2019-12-18 14:40:54,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16394 to 16393. [2019-12-18 14:40:54,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16393 states. [2019-12-18 14:40:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16393 states to 16393 states and 54454 transitions. [2019-12-18 14:40:54,856 INFO L78 Accepts]: Start accepts. Automaton has 16393 states and 54454 transitions. Word has length 22 [2019-12-18 14:40:54,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:54,856 INFO L462 AbstractCegarLoop]: Abstraction has 16393 states and 54454 transitions. [2019-12-18 14:40:54,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:40:54,857 INFO L276 IsEmpty]: Start isEmpty. Operand 16393 states and 54454 transitions. [2019-12-18 14:40:54,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:40:54,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:54,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:40:54,861 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:54,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:54,861 INFO L82 PathProgramCache]: Analyzing trace with hash 458918585, now seen corresponding path program 1 times [2019-12-18 14:40:54,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:54,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396144262] [2019-12-18 14:40:54,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:54,921 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 14:40:54,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396144262] [2019-12-18 14:40:54,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:54,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:40:54,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324979958] [2019-12-18 14:40:54,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:40:54,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:54,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:40:54,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:40:54,924 INFO L87 Difference]: Start difference. First operand 16393 states and 54454 transitions. Second operand 6 states. [2019-12-18 14:40:55,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:55,373 INFO L93 Difference]: Finished difference Result 16929 states and 55199 transitions. [2019-12-18 14:40:55,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:40:55,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 14:40:55,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:55,402 INFO L225 Difference]: With dead ends: 16929 [2019-12-18 14:40:55,403 INFO L226 Difference]: Without dead ends: 16304 [2019-12-18 14:40:55,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:40:55,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16304 states. [2019-12-18 14:40:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16304 to 15537. [2019-12-18 14:40:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15537 states. [2019-12-18 14:40:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15537 states to 15537 states and 51880 transitions. [2019-12-18 14:40:55,696 INFO L78 Accepts]: Start accepts. Automaton has 15537 states and 51880 transitions. Word has length 22 [2019-12-18 14:40:55,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:55,697 INFO L462 AbstractCegarLoop]: Abstraction has 15537 states and 51880 transitions. [2019-12-18 14:40:55,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:40:55,697 INFO L276 IsEmpty]: Start isEmpty. Operand 15537 states and 51880 transitions. [2019-12-18 14:40:55,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 14:40:55,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:55,704 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:40:55,704 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:55,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:55,704 INFO L82 PathProgramCache]: Analyzing trace with hash -103947124, now seen corresponding path program 1 times [2019-12-18 14:40:55,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:55,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943312047] [2019-12-18 14:40:55,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:55,770 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 14:40:55,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943312047] [2019-12-18 14:40:55,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:55,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:40:55,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035698473] [2019-12-18 14:40:55,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:40:55,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:55,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:40:55,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:40:55,772 INFO L87 Difference]: Start difference. First operand 15537 states and 51880 transitions. Second operand 6 states. [2019-12-18 14:40:56,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:56,130 INFO L93 Difference]: Finished difference Result 16321 states and 53473 transitions. [2019-12-18 14:40:56,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:40:56,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 14:40:56,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:56,156 INFO L225 Difference]: With dead ends: 16321 [2019-12-18 14:40:56,156 INFO L226 Difference]: Without dead ends: 15588 [2019-12-18 14:40:56,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:40:56,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15588 states. [2019-12-18 14:40:56,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15588 to 15386. [2019-12-18 14:40:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15386 states. [2019-12-18 14:40:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15386 states to 15386 states and 51412 transitions. [2019-12-18 14:40:56,968 INFO L78 Accepts]: Start accepts. Automaton has 15386 states and 51412 transitions. Word has length 28 [2019-12-18 14:40:56,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:56,968 INFO L462 AbstractCegarLoop]: Abstraction has 15386 states and 51412 transitions. [2019-12-18 14:40:56,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:40:56,968 INFO L276 IsEmpty]: Start isEmpty. Operand 15386 states and 51412 transitions. [2019-12-18 14:40:56,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 14:40:56,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:56,978 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:40:56,979 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:56,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:56,979 INFO L82 PathProgramCache]: Analyzing trace with hash -966417507, now seen corresponding path program 1 times [2019-12-18 14:40:56,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:56,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287195023] [2019-12-18 14:40:56,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:57,060 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 14:40:57,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287195023] [2019-12-18 14:40:57,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:57,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:40:57,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192142650] [2019-12-18 14:40:57,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:40:57,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:57,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:40:57,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:40:57,062 INFO L87 Difference]: Start difference. First operand 15386 states and 51412 transitions. Second operand 5 states. [2019-12-18 14:40:57,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:57,130 INFO L93 Difference]: Finished difference Result 6122 states and 19010 transitions. [2019-12-18 14:40:57,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:40:57,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-18 14:40:57,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:57,142 INFO L225 Difference]: With dead ends: 6122 [2019-12-18 14:40:57,142 INFO L226 Difference]: Without dead ends: 5211 [2019-12-18 14:40:57,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:40:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5211 states. [2019-12-18 14:40:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5211 to 5211. [2019-12-18 14:40:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5211 states. [2019-12-18 14:40:57,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5211 states to 5211 states and 15988 transitions. [2019-12-18 14:40:57,290 INFO L78 Accepts]: Start accepts. Automaton has 5211 states and 15988 transitions. Word has length 31 [2019-12-18 14:40:57,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:57,290 INFO L462 AbstractCegarLoop]: Abstraction has 5211 states and 15988 transitions. [2019-12-18 14:40:57,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:40:57,291 INFO L276 IsEmpty]: Start isEmpty. Operand 5211 states and 15988 transitions. [2019-12-18 14:40:57,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:40:57,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:57,307 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] [2019-12-18 14:40:57,307 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:57,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:57,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1415290960, now seen corresponding path program 1 times [2019-12-18 14:40:57,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:57,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388367565] [2019-12-18 14:40:57,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:57,463 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 14:40:57,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388367565] [2019-12-18 14:40:57,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:57,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:40:57,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551288119] [2019-12-18 14:40:57,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:40:57,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:57,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:40:57,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:40:57,467 INFO L87 Difference]: Start difference. First operand 5211 states and 15988 transitions. Second operand 7 states. [2019-12-18 14:40:57,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:57,776 INFO L93 Difference]: Finished difference Result 5323 states and 16189 transitions. [2019-12-18 14:40:57,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:40:57,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-18 14:40:57,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:57,786 INFO L225 Difference]: With dead ends: 5323 [2019-12-18 14:40:57,786 INFO L226 Difference]: Without dead ends: 4755 [2019-12-18 14:40:57,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:40:57,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2019-12-18 14:40:57,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 4755. [2019-12-18 14:40:57,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4755 states. [2019-12-18 14:40:57,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4755 states to 4755 states and 15072 transitions. [2019-12-18 14:40:57,858 INFO L78 Accepts]: Start accepts. Automaton has 4755 states and 15072 transitions. Word has length 40 [2019-12-18 14:40:57,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:57,858 INFO L462 AbstractCegarLoop]: Abstraction has 4755 states and 15072 transitions. [2019-12-18 14:40:57,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:40:57,859 INFO L276 IsEmpty]: Start isEmpty. Operand 4755 states and 15072 transitions. [2019-12-18 14:40:57,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:40:57,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:57,865 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] [2019-12-18 14:40:57,865 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:57,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:57,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1495792125, now seen corresponding path program 1 times [2019-12-18 14:40:57,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:57,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903943858] [2019-12-18 14:40:57,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:57,945 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 14:40:57,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903943858] [2019-12-18 14:40:57,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:57,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:40:57,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387858673] [2019-12-18 14:40:57,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:40:57,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:57,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:40:57,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:40:57,947 INFO L87 Difference]: Start difference. First operand 4755 states and 15072 transitions. Second operand 5 states. [2019-12-18 14:40:58,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:58,444 INFO L93 Difference]: Finished difference Result 8693 states and 26658 transitions. [2019-12-18 14:40:58,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:40:58,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 14:40:58,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:58,462 INFO L225 Difference]: With dead ends: 8693 [2019-12-18 14:40:58,463 INFO L226 Difference]: Without dead ends: 8693 [2019-12-18 14:40:58,463 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 14:40:58,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8693 states. [2019-12-18 14:40:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8693 to 7254. [2019-12-18 14:40:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7254 states. [2019-12-18 14:40:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7254 states to 7254 states and 22626 transitions. [2019-12-18 14:40:58,579 INFO L78 Accepts]: Start accepts. Automaton has 7254 states and 22626 transitions. Word has length 41 [2019-12-18 14:40:58,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:58,579 INFO L462 AbstractCegarLoop]: Abstraction has 7254 states and 22626 transitions. [2019-12-18 14:40:58,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:40:58,579 INFO L276 IsEmpty]: Start isEmpty. Operand 7254 states and 22626 transitions. [2019-12-18 14:40:58,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:40:58,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:58,589 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] [2019-12-18 14:40:58,589 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:58,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:58,589 INFO L82 PathProgramCache]: Analyzing trace with hash 860786557, now seen corresponding path program 2 times [2019-12-18 14:40:58,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:58,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101025609] [2019-12-18 14:40:58,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:58,633 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 14:40:58,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101025609] [2019-12-18 14:40:58,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:58,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:40:58,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413414946] [2019-12-18 14:40:58,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:40:58,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:58,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:40:58,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:40:58,635 INFO L87 Difference]: Start difference. First operand 7254 states and 22626 transitions. Second operand 3 states. [2019-12-18 14:40:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:58,674 INFO L93 Difference]: Finished difference Result 6756 states and 20623 transitions. [2019-12-18 14:40:58,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:40:58,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 14:40:58,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:58,686 INFO L225 Difference]: With dead ends: 6756 [2019-12-18 14:40:58,686 INFO L226 Difference]: Without dead ends: 6756 [2019-12-18 14:40:58,687 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 14:40:58,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6756 states. [2019-12-18 14:40:58,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6756 to 6680. [2019-12-18 14:40:58,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6680 states. [2019-12-18 14:40:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6680 states to 6680 states and 20406 transitions. [2019-12-18 14:40:58,872 INFO L78 Accepts]: Start accepts. Automaton has 6680 states and 20406 transitions. Word has length 41 [2019-12-18 14:40:58,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:58,872 INFO L462 AbstractCegarLoop]: Abstraction has 6680 states and 20406 transitions. [2019-12-18 14:40:58,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:40:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 6680 states and 20406 transitions. [2019-12-18 14:40:58,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 14:40:58,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:58,886 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:40:58,886 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:58,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:58,887 INFO L82 PathProgramCache]: Analyzing trace with hash -598466109, now seen corresponding path program 1 times [2019-12-18 14:40:58,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:58,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680482708] [2019-12-18 14:40:58,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:58,998 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 14:40:58,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680482708] [2019-12-18 14:40:58,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:58,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:40:58,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285631583] [2019-12-18 14:40:58,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:40:59,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:59,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:40:59,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:40:59,000 INFO L87 Difference]: Start difference. First operand 6680 states and 20406 transitions. Second operand 6 states. [2019-12-18 14:40:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:59,128 INFO L93 Difference]: Finished difference Result 5870 states and 18393 transitions. [2019-12-18 14:40:59,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:40:59,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 14:40:59,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:59,144 INFO L225 Difference]: With dead ends: 5870 [2019-12-18 14:40:59,144 INFO L226 Difference]: Without dead ends: 5782 [2019-12-18 14:40:59,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:40:59,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5782 states. [2019-12-18 14:40:59,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5782 to 5782. [2019-12-18 14:40:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5782 states. [2019-12-18 14:40:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5782 states to 5782 states and 18185 transitions. [2019-12-18 14:40:59,265 INFO L78 Accepts]: Start accepts. Automaton has 5782 states and 18185 transitions. Word has length 42 [2019-12-18 14:40:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:59,266 INFO L462 AbstractCegarLoop]: Abstraction has 5782 states and 18185 transitions. [2019-12-18 14:40:59,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:40:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 5782 states and 18185 transitions. [2019-12-18 14:40:59,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:40:59,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:59,274 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 14:40:59,275 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:59,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:59,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1916857338, now seen corresponding path program 1 times [2019-12-18 14:40:59,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:59,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001228522] [2019-12-18 14:40:59,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:59,308 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 14:40:59,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001228522] [2019-12-18 14:40:59,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:59,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:40:59,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35023188] [2019-12-18 14:40:59,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:40:59,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:59,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:40:59,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:40:59,310 INFO L87 Difference]: Start difference. First operand 5782 states and 18185 transitions. Second operand 3 states. [2019-12-18 14:40:59,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:59,369 INFO L93 Difference]: Finished difference Result 7834 states and 24076 transitions. [2019-12-18 14:40:59,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:40:59,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 14:40:59,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:59,383 INFO L225 Difference]: With dead ends: 7834 [2019-12-18 14:40:59,383 INFO L226 Difference]: Without dead ends: 7834 [2019-12-18 14:40:59,384 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 14:40:59,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7834 states. [2019-12-18 14:40:59,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7834 to 6424. [2019-12-18 14:40:59,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6424 states. [2019-12-18 14:40:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6424 states to 6424 states and 20079 transitions. [2019-12-18 14:40:59,568 INFO L78 Accepts]: Start accepts. Automaton has 6424 states and 20079 transitions. Word has length 56 [2019-12-18 14:40:59,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:59,569 INFO L462 AbstractCegarLoop]: Abstraction has 6424 states and 20079 transitions. [2019-12-18 14:40:59,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:40:59,569 INFO L276 IsEmpty]: Start isEmpty. Operand 6424 states and 20079 transitions. [2019-12-18 14:41:00,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:41:00,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:00,067 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 14:41:00,067 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:00,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:00,067 INFO L82 PathProgramCache]: Analyzing trace with hash -261820410, now seen corresponding path program 1 times [2019-12-18 14:41:00,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:00,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660438460] [2019-12-18 14:41:00,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:00,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:00,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660438460] [2019-12-18 14:41:00,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:00,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 14:41:00,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012360312] [2019-12-18 14:41:00,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 14:41:00,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:00,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 14:41:00,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:41:00,727 INFO L87 Difference]: Start difference. First operand 6424 states and 20079 transitions. Second operand 17 states. [2019-12-18 14:41:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:05,086 INFO L93 Difference]: Finished difference Result 11463 states and 34617 transitions. [2019-12-18 14:41:05,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-18 14:41:05,086 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-18 14:41:05,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:05,102 INFO L225 Difference]: With dead ends: 11463 [2019-12-18 14:41:05,102 INFO L226 Difference]: Without dead ends: 9365 [2019-12-18 14:41:05,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=382, Invalid=2810, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 14:41:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9365 states. [2019-12-18 14:41:05,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9365 to 7627. [2019-12-18 14:41:05,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7627 states. [2019-12-18 14:41:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7627 states to 7627 states and 23574 transitions. [2019-12-18 14:41:05,251 INFO L78 Accepts]: Start accepts. Automaton has 7627 states and 23574 transitions. Word has length 56 [2019-12-18 14:41:05,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:05,252 INFO L462 AbstractCegarLoop]: Abstraction has 7627 states and 23574 transitions. [2019-12-18 14:41:05,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 14:41:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 7627 states and 23574 transitions. [2019-12-18 14:41:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:41:05,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:05,261 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 14:41:05,261 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:05,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:05,262 INFO L82 PathProgramCache]: Analyzing trace with hash -750829362, now seen corresponding path program 2 times [2019-12-18 14:41:05,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:05,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000454164] [2019-12-18 14:41:05,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:05,813 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 14:41:05,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000454164] [2019-12-18 14:41:05,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:05,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 14:41:05,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023476364] [2019-12-18 14:41:05,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 14:41:05,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:05,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 14:41:05,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:41:05,815 INFO L87 Difference]: Start difference. First operand 7627 states and 23574 transitions. Second operand 17 states. [2019-12-18 14:41:10,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:10,220 INFO L93 Difference]: Finished difference Result 14411 states and 43447 transitions. [2019-12-18 14:41:10,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-18 14:41:10,220 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-18 14:41:10,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:10,234 INFO L225 Difference]: With dead ends: 14411 [2019-12-18 14:41:10,234 INFO L226 Difference]: Without dead ends: 8379 [2019-12-18 14:41:10,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=590, Invalid=3700, Unknown=0, NotChecked=0, Total=4290 [2019-12-18 14:41:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8379 states. [2019-12-18 14:41:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8379 to 7488. [2019-12-18 14:41:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7488 states. [2019-12-18 14:41:10,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7488 states to 7488 states and 23005 transitions. [2019-12-18 14:41:10,348 INFO L78 Accepts]: Start accepts. Automaton has 7488 states and 23005 transitions. Word has length 56 [2019-12-18 14:41:10,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:10,349 INFO L462 AbstractCegarLoop]: Abstraction has 7488 states and 23005 transitions. [2019-12-18 14:41:10,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 14:41:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand 7488 states and 23005 transitions. [2019-12-18 14:41:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:41:10,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:10,357 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 14:41:10,358 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:10,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:10,358 INFO L82 PathProgramCache]: Analyzing trace with hash -899860532, now seen corresponding path program 3 times [2019-12-18 14:41:10,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:10,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994807942] [2019-12-18 14:41:10,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:10,699 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 14:41:10,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994807942] [2019-12-18 14:41:10,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:10,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 14:41:10,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527024558] [2019-12-18 14:41:10,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 14:41:10,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:10,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 14:41:10,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:41:10,703 INFO L87 Difference]: Start difference. First operand 7488 states and 23005 transitions. Second operand 14 states. [2019-12-18 14:41:14,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:14,040 INFO L93 Difference]: Finished difference Result 16816 states and 49973 transitions. [2019-12-18 14:41:14,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-18 14:41:14,040 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-18 14:41:14,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:14,056 INFO L225 Difference]: With dead ends: 16816 [2019-12-18 14:41:14,056 INFO L226 Difference]: Without dead ends: 10099 [2019-12-18 14:41:14,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=417, Invalid=2235, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 14:41:14,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10099 states. [2019-12-18 14:41:14,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10099 to 7882. [2019-12-18 14:41:14,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7882 states. [2019-12-18 14:41:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7882 states to 7882 states and 24107 transitions. [2019-12-18 14:41:14,176 INFO L78 Accepts]: Start accepts. Automaton has 7882 states and 24107 transitions. Word has length 56 [2019-12-18 14:41:14,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:14,177 INFO L462 AbstractCegarLoop]: Abstraction has 7882 states and 24107 transitions. [2019-12-18 14:41:14,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 14:41:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 7882 states and 24107 transitions. [2019-12-18 14:41:14,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:41:14,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:14,189 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 14:41:14,189 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:14,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:14,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1777349942, now seen corresponding path program 4 times [2019-12-18 14:41:14,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:14,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616343627] [2019-12-18 14:41:14,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:14,300 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 14:41:14,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616343627] [2019-12-18 14:41:14,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:14,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:41:14,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515260360] [2019-12-18 14:41:14,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:41:14,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:14,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:41:14,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:41:14,304 INFO L87 Difference]: Start difference. First operand 7882 states and 24107 transitions. Second operand 9 states. [2019-12-18 14:41:15,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:15,200 INFO L93 Difference]: Finished difference Result 13642 states and 41156 transitions. [2019-12-18 14:41:15,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 14:41:15,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-18 14:41:15,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:15,215 INFO L225 Difference]: With dead ends: 13642 [2019-12-18 14:41:15,215 INFO L226 Difference]: Without dead ends: 9286 [2019-12-18 14:41:15,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:41:15,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9286 states. [2019-12-18 14:41:15,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9286 to 8182. [2019-12-18 14:41:15,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8182 states. [2019-12-18 14:41:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8182 states to 8182 states and 24678 transitions. [2019-12-18 14:41:15,338 INFO L78 Accepts]: Start accepts. Automaton has 8182 states and 24678 transitions. Word has length 56 [2019-12-18 14:41:15,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:15,339 INFO L462 AbstractCegarLoop]: Abstraction has 8182 states and 24678 transitions. [2019-12-18 14:41:15,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:41:15,339 INFO L276 IsEmpty]: Start isEmpty. Operand 8182 states and 24678 transitions. [2019-12-18 14:41:15,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:41:15,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:15,351 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 14:41:15,351 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:15,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:15,351 INFO L82 PathProgramCache]: Analyzing trace with hash -76455038, now seen corresponding path program 5 times [2019-12-18 14:41:15,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:15,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095078219] [2019-12-18 14:41:15,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:15,503 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 14:41:15,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095078219] [2019-12-18 14:41:15,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:15,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:41:15,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357591178] [2019-12-18 14:41:15,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:41:15,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:15,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:41:15,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:41:15,505 INFO L87 Difference]: Start difference. First operand 8182 states and 24678 transitions. Second operand 10 states. [2019-12-18 14:41:16,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:16,387 INFO L93 Difference]: Finished difference Result 12469 states and 37324 transitions. [2019-12-18 14:41:16,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 14:41:16,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-18 14:41:16,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:16,412 INFO L225 Difference]: With dead ends: 12469 [2019-12-18 14:41:16,413 INFO L226 Difference]: Without dead ends: 9481 [2019-12-18 14:41:16,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2019-12-18 14:41:16,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9481 states. [2019-12-18 14:41:16,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9481 to 8214. [2019-12-18 14:41:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8214 states. [2019-12-18 14:41:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8214 states to 8214 states and 24766 transitions. [2019-12-18 14:41:16,630 INFO L78 Accepts]: Start accepts. Automaton has 8214 states and 24766 transitions. Word has length 56 [2019-12-18 14:41:16,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:16,630 INFO L462 AbstractCegarLoop]: Abstraction has 8214 states and 24766 transitions. [2019-12-18 14:41:16,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:41:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 8214 states and 24766 transitions. [2019-12-18 14:41:16,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:41:16,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:16,643 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 14:41:16,643 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:16,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:16,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1683026640, now seen corresponding path program 6 times [2019-12-18 14:41:16,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:16,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442379673] [2019-12-18 14:41:16,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:16,793 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 14:41:16,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442379673] [2019-12-18 14:41:16,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:16,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:41:16,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409498985] [2019-12-18 14:41:16,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:41:16,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:16,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:41:16,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:41:16,795 INFO L87 Difference]: Start difference. First operand 8214 states and 24766 transitions. Second operand 11 states. [2019-12-18 14:41:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:17,519 INFO L93 Difference]: Finished difference Result 11489 states and 34354 transitions. [2019-12-18 14:41:17,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 14:41:17,520 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 14:41:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:17,535 INFO L225 Difference]: With dead ends: 11489 [2019-12-18 14:41:17,535 INFO L226 Difference]: Without dead ends: 8494 [2019-12-18 14:41:17,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-18 14:41:17,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8494 states. [2019-12-18 14:41:17,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8494 to 7696. [2019-12-18 14:41:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7696 states. [2019-12-18 14:41:17,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7696 states to 7696 states and 23362 transitions. [2019-12-18 14:41:17,652 INFO L78 Accepts]: Start accepts. Automaton has 7696 states and 23362 transitions. Word has length 56 [2019-12-18 14:41:17,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:17,653 INFO L462 AbstractCegarLoop]: Abstraction has 7696 states and 23362 transitions. [2019-12-18 14:41:17,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:41:17,653 INFO L276 IsEmpty]: Start isEmpty. Operand 7696 states and 23362 transitions. [2019-12-18 14:41:17,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:41:17,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:17,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:17,663 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:17,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:17,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1827744688, now seen corresponding path program 7 times [2019-12-18 14:41:17,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:17,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312676752] [2019-12-18 14:41:17,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:41:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:41:17,756 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:41:17,757 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:41:17,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~x$r_buff1_thd1~0_405 0) (= v_~z~0_42 0) (= v_~y~0_203 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2064~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2064~0.base_25|) |v_ULTIMATE.start_main_~#t2064~0.offset_19| 0)) |v_#memory_int_23|) (= 0 v_~x$w_buff1~0_314) (= 0 v_~x$r_buff0_thd3~0_141) (= v_~x$flush_delayed~0_58 0) (= v_~__unbuffered_p0_EBX~0_60 0) (= v_~x$mem_tmp~0_35 0) (= 0 v_~__unbuffered_p2_EAX~0_39) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$w_buff0_used~0_913) (= v_~x$r_buff0_thd0~0_157 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2064~0.base_25|) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$w_buff1_used~0_606) (= 0 v_~weak$$choice0~0_33) (= 0 v_~x$r_buff0_thd2~0_302) (= 0 v_~x$r_buff1_thd2~0_251) (= v_~x$r_buff1_thd0~0_275 0) (= 0 v_~x$w_buff0~0_388) (= |v_#NULL.offset_4| 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t2064~0.base_25| 1)) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_254) (= v_~main$tmp_guard0~0_48 0) (= 0 |v_ULTIMATE.start_main_~#t2064~0.offset_19|) (= 0 v_~x~0_230) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2064~0.base_25|)) (= v_~weak$$choice2~0_176 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2064~0.base_25| 4)) (= v_~x$r_buff0_thd1~0_365 0) (= 0 v_~__unbuffered_p0_EAX~0_54))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_388, ~x$flush_delayed~0=v_~x$flush_delayed~0_58, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_405, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_141, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_~#t2064~0.offset=|v_ULTIMATE.start_main_~#t2064~0.offset_19|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_157, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_606, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_251, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_33, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_230, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_365, ULTIMATE.start_main_~#t2064~0.base=|v_ULTIMATE.start_main_~#t2064~0.base_25|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_71|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_35, ULTIMATE.start_main_~#t2065~0.offset=|v_ULTIMATE.start_main_~#t2065~0.offset_19|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_59|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ~y~0=v_~y~0_203, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_48, ULTIMATE.start_main_~#t2065~0.base=|v_ULTIMATE.start_main_~#t2065~0.base_26|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_275, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_302, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_~#t2066~0.base=|v_ULTIMATE.start_main_~#t2066~0.base_21|, ULTIMATE.start_main_~#t2066~0.offset=|v_ULTIMATE.start_main_~#t2066~0.offset_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_42, ~weak$$choice2~0=v_~weak$$choice2~0_176, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2064~0.offset, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2064~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t2065~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2065~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t2066~0.base, ULTIMATE.start_main_~#t2066~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 14:41:17,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L818-1-->L820: Formula: (and (= |v_ULTIMATE.start_main_~#t2065~0.offset_9| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2065~0.base_10| 4)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2065~0.base_10| 1) |v_#valid_31|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2065~0.base_10|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2065~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t2065~0.base_10| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2065~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2065~0.base_10|) |v_ULTIMATE.start_main_~#t2065~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2065~0.base=|v_ULTIMATE.start_main_~#t2065~0.base_10|, ULTIMATE.start_main_~#t2065~0.offset=|v_ULTIMATE.start_main_~#t2065~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2065~0.base, ULTIMATE.start_main_~#t2065~0.offset] because there is no mapped edge [2019-12-18 14:41:17,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L820-1-->L822: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2066~0.base_11| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2066~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2066~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2066~0.base_11|) |v_ULTIMATE.start_main_~#t2066~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2066~0.base_11| 1)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2066~0.base_11|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2066~0.base_11|) (= |v_ULTIMATE.start_main_~#t2066~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2066~0.base=|v_ULTIMATE.start_main_~#t2066~0.base_11|, ULTIMATE.start_main_~#t2066~0.offset=|v_ULTIMATE.start_main_~#t2066~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2066~0.base, ULTIMATE.start_main_~#t2066~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 14:41:17,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff1_used~0_56 v_~x$w_buff0_used~0_106) (= v_P1Thread1of1ForFork0_~arg.offset_7 |v_P1Thread1of1ForFork0_#in~arg.offset_7|) (= v_P1Thread1of1ForFork0_~arg.base_7 |v_P1Thread1of1ForFork0_#in~arg.base_7|) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_15) (= 1 v_~x$w_buff0_used~0_105) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= 0 (mod v_~x$w_buff1_used~0_56 256)) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_9, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_7, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_7, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 14:41:17,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1797407027 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1797407027 256) 0))) (or (and (not .cse0) (= ~x$w_buff1~0_In1797407027 |P2Thread1of1ForFork1_#t~ite32_Out1797407027|) (not .cse1)) (and (= ~x~0_In1797407027 |P2Thread1of1ForFork1_#t~ite32_Out1797407027|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1797407027, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1797407027, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1797407027, ~x~0=~x~0_In1797407027} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1797407027|, ~x$w_buff1~0=~x$w_buff1~0_In1797407027, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1797407027, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1797407027, ~x~0=~x~0_In1797407027} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 14:41:17,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_10|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_10|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 14:41:17,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-609935291 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-609935291 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-609935291 |P2Thread1of1ForFork1_#t~ite34_Out-609935291|)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out-609935291| 0) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-609935291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-609935291} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-609935291|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-609935291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-609935291} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 14:41:17,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In230857068 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In230857068 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out230857068| ~x$w_buff0_used~0_In230857068)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out230857068| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In230857068, ~x$w_buff0_used~0=~x$w_buff0_used~0_In230857068} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In230857068, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out230857068|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In230857068} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 14:41:17,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1496442359 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-1496442359 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1496442359 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1496442359 256) 0))) (or (and (= ~x$w_buff1_used~0_In-1496442359 |P1Thread1of1ForFork0_#t~ite29_Out-1496442359|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1496442359|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1496442359, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1496442359, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1496442359, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1496442359} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1496442359, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1496442359, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1496442359, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1496442359|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1496442359} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 14:41:17,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2134144348 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite9_Out2134144348| |P0Thread1of1ForFork2_#t~ite8_Out2134144348|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In2134144348 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In2134144348 256)) (and (= 0 (mod ~x$w_buff1_used~0_In2134144348 256)) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In2134144348 256) 0) .cse1))) (= |P0Thread1of1ForFork2_#t~ite8_Out2134144348| ~x$w_buff0~0_In2134144348)) (and (= |P0Thread1of1ForFork2_#t~ite9_Out2134144348| ~x$w_buff0~0_In2134144348) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite8_In2134144348| |P0Thread1of1ForFork2_#t~ite8_Out2134144348|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In2134144348, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2134144348, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In2134144348|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2134144348, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2134144348, ~weak$$choice2~0=~weak$$choice2~0_In2134144348, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2134144348} OutVars{~x$w_buff0~0=~x$w_buff0~0_In2134144348, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2134144348, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out2134144348|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2134144348, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out2134144348|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2134144348, ~weak$$choice2~0=~weak$$choice2~0_In2134144348, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2134144348} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 14:41:17,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1545275397 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite15_Out1545275397| ~x$w_buff0_used~0_In1545275397) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In1545275397| |P0Thread1of1ForFork2_#t~ite14_Out1545275397|)) (and (= |P0Thread1of1ForFork2_#t~ite14_Out1545275397| |P0Thread1of1ForFork2_#t~ite15_Out1545275397|) (= |P0Thread1of1ForFork2_#t~ite14_Out1545275397| ~x$w_buff0_used~0_In1545275397) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1545275397 256)))) (or (= (mod ~x$w_buff0_used~0_In1545275397 256) 0) (and (= 0 (mod ~x$w_buff1_used~0_In1545275397 256)) .cse1) (and (= 0 (mod ~x$r_buff1_thd1~0_In1545275397 256)) .cse1))) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1545275397, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1545275397, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1545275397, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1545275397|, ~weak$$choice2~0=~weak$$choice2~0_In1545275397, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1545275397} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1545275397, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1545275397, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1545275397|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1545275397, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1545275397|, ~weak$$choice2~0=~weak$$choice2~0_In1545275397, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1545275397} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 14:41:17,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In307278342 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_In307278342| |P0Thread1of1ForFork2_#t~ite17_Out307278342|) (not .cse0) (= ~x$w_buff1_used~0_In307278342 |P0Thread1of1ForFork2_#t~ite18_Out307278342|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In307278342 256)))) (or (= (mod ~x$w_buff0_used~0_In307278342 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In307278342 256) 0)) (and .cse1 (= (mod ~x$w_buff1_used~0_In307278342 256) 0)))) (= ~x$w_buff1_used~0_In307278342 |P0Thread1of1ForFork2_#t~ite17_Out307278342|) .cse0 (= |P0Thread1of1ForFork2_#t~ite18_Out307278342| |P0Thread1of1ForFork2_#t~ite17_Out307278342|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In307278342, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In307278342|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In307278342, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In307278342, ~weak$$choice2~0=~weak$$choice2~0_In307278342, ~x$w_buff0_used~0=~x$w_buff0_used~0_In307278342} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In307278342, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out307278342|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out307278342|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In307278342, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In307278342, ~weak$$choice2~0=~weak$$choice2~0_In307278342, ~x$w_buff0_used~0=~x$w_buff0_used~0_In307278342} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 14:41:17,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_112 v_~x$r_buff0_thd1~0_111) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_111, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_17|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 14:41:17,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1374742950 256) 0))) (or (and (= ~x$r_buff1_thd1~0_In1374742950 |P0Thread1of1ForFork2_#t~ite24_Out1374742950|) (= |P0Thread1of1ForFork2_#t~ite23_In1374742950| |P0Thread1of1ForFork2_#t~ite23_Out1374742950|) (not .cse0)) (and (= ~x$r_buff1_thd1~0_In1374742950 |P0Thread1of1ForFork2_#t~ite23_Out1374742950|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1374742950 256)))) (or (and (= (mod ~x$r_buff1_thd1~0_In1374742950 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In1374742950 256) 0) (and (= (mod ~x$w_buff1_used~0_In1374742950 256) 0) .cse1))) (= |P0Thread1of1ForFork2_#t~ite23_Out1374742950| |P0Thread1of1ForFork2_#t~ite24_Out1374742950|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1374742950, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1374742950, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1374742950, ~weak$$choice2~0=~weak$$choice2~0_In1374742950, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1374742950|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1374742950} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1374742950, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1374742950, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1374742950, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1374742950|, ~weak$$choice2~0=~weak$$choice2~0_In1374742950, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1374742950|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1374742950} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 14:41:17,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-373848980 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-373848980 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-373848980 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-373848980 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out-373848980| ~x$w_buff1_used~0_In-373848980) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out-373848980| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-373848980, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-373848980, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-373848980, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-373848980} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-373848980|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-373848980, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-373848980, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-373848980, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-373848980} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 14:41:17,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1445372243 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1445372243 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out1445372243| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out1445372243| ~x$r_buff0_thd3~0_In1445372243)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1445372243, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1445372243} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1445372243|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1445372243, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1445372243} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 14:41:17,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1464886691 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1464886691 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-1464886691 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1464886691 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out-1464886691| ~x$r_buff1_thd3~0_In-1464886691) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out-1464886691| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1464886691, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1464886691, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1464886691, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1464886691} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1464886691|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1464886691, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1464886691, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1464886691, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1464886691} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:41:17,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_52 |v_P2Thread1of1ForFork1_#t~ite37_30|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_53 1) v_~__unbuffered_cnt~0_52)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 14:41:17,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L778-->L779: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1257584039 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1257584039 256)))) (or (and (= ~x$r_buff0_thd2~0_Out-1257584039 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_Out-1257584039 ~x$r_buff0_thd2~0_In-1257584039) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1257584039, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1257584039} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1257584039|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1257584039, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1257584039} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:41:17,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-368877001 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-368877001 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-368877001 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-368877001 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out-368877001| ~x$r_buff1_thd2~0_In-368877001) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork0_#t~ite31_Out-368877001| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-368877001, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-368877001, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-368877001, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-368877001} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-368877001|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-368877001, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-368877001, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-368877001, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-368877001} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 14:41:17,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L779-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_50, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 14:41:17,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 14:41:17,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L826-->L828-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~x$r_buff0_thd0~0_27 256) 0) (= (mod v_~x$w_buff0_used~0_180 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:41:17,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-1828623182 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1828623182 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-1828623182 |ULTIMATE.start_main_#t~ite41_Out-1828623182|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite41_Out-1828623182| ~x~0_In-1828623182)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1828623182, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1828623182, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1828623182, ~x~0=~x~0_In-1828623182} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1828623182|, ~x$w_buff1~0=~x$w_buff1~0_In-1828623182, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1828623182, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1828623182, ~x~0=~x~0_In-1828623182} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 14:41:17,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L828-4-->L829: Formula: (= v_~x~0_26 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|, ~x~0=v_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 14:41:17,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In896956991 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In896956991 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out896956991|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out896956991| ~x$w_buff0_used~0_In896956991)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In896956991, ~x$w_buff0_used~0=~x$w_buff0_used~0_In896956991} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In896956991, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out896956991|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In896956991} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 14:41:17,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-694966987 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-694966987 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-694966987 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-694966987 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-694966987 |ULTIMATE.start_main_#t~ite44_Out-694966987|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-694966987|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-694966987, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-694966987, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-694966987, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-694966987} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-694966987, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-694966987, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-694966987, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-694966987|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-694966987} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 14:41:17,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In311354710 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In311354710 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out311354710| 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In311354710 |ULTIMATE.start_main_#t~ite45_Out311354710|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In311354710, ~x$w_buff0_used~0=~x$w_buff0_used~0_In311354710} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In311354710, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out311354710|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In311354710} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 14:41:17,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In351801458 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In351801458 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In351801458 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In351801458 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out351801458|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In351801458 |ULTIMATE.start_main_#t~ite46_Out351801458|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In351801458, ~x$w_buff1_used~0=~x$w_buff1_used~0_In351801458, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In351801458, ~x$w_buff0_used~0=~x$w_buff0_used~0_In351801458} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In351801458, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out351801458|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In351801458, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In351801458, ~x$w_buff0_used~0=~x$w_buff0_used~0_In351801458} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 14:41:17,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p0_EBX~0_48 0) (= 1 v_~__unbuffered_p2_EAX~0_27) (= v_~x$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite46_48|) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 1 v_~__unbuffered_p0_EAX~0_42) (= v_~main$tmp_guard1~0_23 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_255, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:41:17,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:41:17 BasicIcfg [2019-12-18 14:41:17,851 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:41:17,853 INFO L168 Benchmark]: Toolchain (without parser) took 153147.55 ms. Allocated memory was 139.5 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 101.8 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 14:41:17,854 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 14:41:17,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.95 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 101.4 MB in the beginning and 157.3 MB in the end (delta: -55.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-18 14:41:17,855 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.72 ms. Allocated memory is still 204.5 MB. Free memory was 157.3 MB in the beginning and 154.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:41:17,855 INFO L168 Benchmark]: Boogie Preprocessor took 51.35 ms. Allocated memory is still 204.5 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:41:17,856 INFO L168 Benchmark]: RCFGBuilder took 764.97 ms. Allocated memory is still 204.5 MB. Free memory was 152.6 MB in the beginning and 105.7 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:41:17,856 INFO L168 Benchmark]: TraceAbstraction took 151474.29 ms. Allocated memory was 204.5 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 105.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 14:41:17,859 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 780.95 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 101.4 MB in the beginning and 157.3 MB in the end (delta: -55.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.72 ms. Allocated memory is still 204.5 MB. Free memory was 157.3 MB in the beginning and 154.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.35 ms. Allocated memory is still 204.5 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 764.97 ms. Allocated memory is still 204.5 MB. Free memory was 152.6 MB in the beginning and 105.7 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 151474.29 ms. Allocated memory was 204.5 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 105.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 164 ProgramPointsBefore, 81 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 27 ChoiceCompositions, 6883 VarBasedMoverChecksPositive, 281 VarBasedMoverChecksNegative, 110 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 64821 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2064, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2065, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2066, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L732] 1 __unbuffered_p0_EAX = z [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 151.1s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 61.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3529 SDtfs, 6701 SDslu, 12378 SDs, 0 SdLazy, 11948 SolverSat, 441 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 363 GetRequests, 28 SyntacticMatches, 18 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3212 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137168occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 69.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 131756 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 857 NumberOfCodeBlocks, 857 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 154998 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...