/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:45:15,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:45:15,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:45:15,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:45:15,363 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:45:15,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:45:15,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:45:15,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:45:15,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:45:15,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:45:15,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:45:15,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:45:15,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:45:15,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:45:15,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:45:15,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:45:15,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:45:15,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:45:15,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:45:15,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:45:15,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:45:15,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:45:15,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:45:15,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:45:15,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:45:15,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:45:15,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:45:15,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:45:15,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:45:15,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:45:15,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:45:15,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:45:15,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:45:15,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:45:15,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:45:15,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:45:15,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:45:15,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:45:15,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:45:15,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:45:15,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:45:15,411 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:45:15,429 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:45:15,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:45:15,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:45:15,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:45:15,432 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:45:15,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:45:15,432 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:45:15,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:45:15,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:45:15,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:45:15,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:45:15,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:45:15,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:45:15,434 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:45:15,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:45:15,435 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:45:15,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:45:15,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:45:15,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:45:15,436 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:45:15,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:45:15,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:45:15,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:45:15,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:45:15,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:45:15,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:45:15,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:45:15,437 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:45:15,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:45:15,437 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:45:15,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:45:15,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:45:15,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:45:15,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:45:15,762 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:45:15,762 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:45:15,763 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_power.opt.i [2019-12-27 17:45:15,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10f414c41/b7db194593f74e2b88dbed0d8f21f358/FLAG89dfaf213 [2019-12-27 17:45:16,362 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:45:16,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_power.opt.i [2019-12-27 17:45:16,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10f414c41/b7db194593f74e2b88dbed0d8f21f358/FLAG89dfaf213 [2019-12-27 17:45:16,680 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10f414c41/b7db194593f74e2b88dbed0d8f21f358 [2019-12-27 17:45:16,690 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:45:16,692 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:45:16,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:45:16,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:45:16,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:45:16,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:45:16" (1/1) ... [2019-12-27 17:45:16,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23a66491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:16, skipping insertion in model container [2019-12-27 17:45:16,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:45:16" (1/1) ... [2019-12-27 17:45:16,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:45:16,774 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:45:17,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:45:17,273 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:45:17,376 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:45:17,448 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:45:17,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:17 WrapperNode [2019-12-27 17:45:17,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:45:17,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:45:17,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:45:17,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:45:17,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:17" (1/1) ... [2019-12-27 17:45:17,480 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:17" (1/1) ... [2019-12-27 17:45:17,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:45:17,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:45:17,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:45:17,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:45:17,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:17" (1/1) ... [2019-12-27 17:45:17,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:17" (1/1) ... [2019-12-27 17:45:17,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:17" (1/1) ... [2019-12-27 17:45:17,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:17" (1/1) ... [2019-12-27 17:45:17,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:17" (1/1) ... [2019-12-27 17:45:17,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:17" (1/1) ... [2019-12-27 17:45:17,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:17" (1/1) ... [2019-12-27 17:45:17,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:45:17,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:45:17,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:45:17,548 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:45:17,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:17" (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-27 17:45:17,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:45:17,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:45:17,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:45:17,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:45:17,610 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:45:17,611 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:45:17,611 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:45:17,611 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:45:17,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:45:17,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:45:17,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:45:17,613 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:45:18,252 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:45:18,252 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:45:18,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:45:18 BoogieIcfgContainer [2019-12-27 17:45:18,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:45:18,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:45:18,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:45:18,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:45:18,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:45:16" (1/3) ... [2019-12-27 17:45:18,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee79319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:45:18, skipping insertion in model container [2019-12-27 17:45:18,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:17" (2/3) ... [2019-12-27 17:45:18,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee79319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:45:18, skipping insertion in model container [2019-12-27 17:45:18,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:45:18" (3/3) ... [2019-12-27 17:45:18,262 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_power.opt.i [2019-12-27 17:45:18,272 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:45:18,272 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:45:18,280 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:45:18,281 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:45:18,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,319 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,320 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,344 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,345 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,345 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,345 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,345 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,357 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,363 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,364 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:18,384 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:45:18,405 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:45:18,405 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:45:18,405 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:45:18,405 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:45:18,405 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:45:18,406 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:45:18,406 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:45:18,406 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:45:18,422 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-27 17:45:18,424 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-27 17:45:18,525 INFO L132 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-27 17:45:18,525 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:45:18,540 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/126 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 17:45:18,560 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-27 17:45:18,602 INFO L132 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-27 17:45:18,603 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:45:18,610 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/126 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 17:45:18,623 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 17:45:18,624 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:45:23,055 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 17:45:23,192 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 17:45:23,240 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39043 [2019-12-27 17:45:23,240 INFO L214 etLargeBlockEncoding]: Total number of compositions: 99 [2019-12-27 17:45:23,244 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-12-27 17:45:23,608 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6812 states. [2019-12-27 17:45:23,611 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states. [2019-12-27 17:45:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 17:45:23,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:23,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 17:45:23,620 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:23,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:23,628 INFO L82 PathProgramCache]: Analyzing trace with hash 679696961, now seen corresponding path program 1 times [2019-12-27 17:45:23,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:23,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64800787] [2019-12-27 17:45:23,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:23,875 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-27 17:45:23,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64800787] [2019-12-27 17:45:23,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:23,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:45:23,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1566281889] [2019-12-27 17:45:23,881 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:23,890 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:23,908 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 17:45:23,909 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:23,913 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:45:23,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:45:23,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:23,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:45:23,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:45:23,930 INFO L87 Difference]: Start difference. First operand 6812 states. Second operand 3 states. [2019-12-27 17:45:24,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:24,193 INFO L93 Difference]: Finished difference Result 6636 states and 22229 transitions. [2019-12-27 17:45:24,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:45:24,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 17:45:24,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:24,276 INFO L225 Difference]: With dead ends: 6636 [2019-12-27 17:45:24,276 INFO L226 Difference]: Without dead ends: 6246 [2019-12-27 17:45:24,278 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-27 17:45:24,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6246 states. [2019-12-27 17:45:24,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6246 to 6246. [2019-12-27 17:45:24,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6246 states. [2019-12-27 17:45:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6246 states to 6246 states and 20886 transitions. [2019-12-27 17:45:24,746 INFO L78 Accepts]: Start accepts. Automaton has 6246 states and 20886 transitions. Word has length 5 [2019-12-27 17:45:24,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:24,748 INFO L462 AbstractCegarLoop]: Abstraction has 6246 states and 20886 transitions. [2019-12-27 17:45:24,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:45:24,755 INFO L276 IsEmpty]: Start isEmpty. Operand 6246 states and 20886 transitions. [2019-12-27 17:45:24,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:45:24,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:24,764 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:45:24,765 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:24,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:24,767 INFO L82 PathProgramCache]: Analyzing trace with hash -113641298, now seen corresponding path program 1 times [2019-12-27 17:45:24,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:24,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401477867] [2019-12-27 17:45:24,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:24,931 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-27 17:45:24,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401477867] [2019-12-27 17:45:24,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:24,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:45:24,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [980599797] [2019-12-27 17:45:24,934 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:24,936 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:24,940 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:45:24,941 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:24,941 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:45:24,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:45:24,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:24,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:45:24,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:45:24,943 INFO L87 Difference]: Start difference. First operand 6246 states and 20886 transitions. Second operand 4 states. [2019-12-27 17:45:25,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:25,027 INFO L93 Difference]: Finished difference Result 1666 states and 4431 transitions. [2019-12-27 17:45:25,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:45:25,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:45:25,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:25,038 INFO L225 Difference]: With dead ends: 1666 [2019-12-27 17:45:25,039 INFO L226 Difference]: Without dead ends: 1276 [2019-12-27 17:45:25,041 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-27 17:45:25,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2019-12-27 17:45:25,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1276. [2019-12-27 17:45:25,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2019-12-27 17:45:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 3147 transitions. [2019-12-27 17:45:25,093 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 3147 transitions. Word has length 11 [2019-12-27 17:45:25,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:25,093 INFO L462 AbstractCegarLoop]: Abstraction has 1276 states and 3147 transitions. [2019-12-27 17:45:25,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:45:25,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 3147 transitions. [2019-12-27 17:45:25,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:45:25,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:25,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:45:25,098 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:25,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:25,099 INFO L82 PathProgramCache]: Analyzing trace with hash 711580898, now seen corresponding path program 1 times [2019-12-27 17:45:25,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:25,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648097144] [2019-12-27 17:45:25,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:25,277 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-27 17:45:25,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648097144] [2019-12-27 17:45:25,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:25,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:45:25,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [373282678] [2019-12-27 17:45:25,278 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:25,281 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:25,289 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 17:45:25,289 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:25,352 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:45:25,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:45:25,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:25,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:45:25,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:45:25,354 INFO L87 Difference]: Start difference. First operand 1276 states and 3147 transitions. Second operand 5 states. [2019-12-27 17:45:25,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:25,458 INFO L93 Difference]: Finished difference Result 1986 states and 4934 transitions. [2019-12-27 17:45:25,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:45:25,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 17:45:25,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:25,471 INFO L225 Difference]: With dead ends: 1986 [2019-12-27 17:45:25,471 INFO L226 Difference]: Without dead ends: 1986 [2019-12-27 17:45:25,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:45:25,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2019-12-27 17:45:25,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1490. [2019-12-27 17:45:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2019-12-27 17:45:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 3702 transitions. [2019-12-27 17:45:25,516 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 3702 transitions. Word has length 14 [2019-12-27 17:45:25,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:25,517 INFO L462 AbstractCegarLoop]: Abstraction has 1490 states and 3702 transitions. [2019-12-27 17:45:25,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:45:25,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 3702 transitions. [2019-12-27 17:45:25,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:45:25,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:25,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:45:25,519 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:25,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:25,519 INFO L82 PathProgramCache]: Analyzing trace with hash 798779155, now seen corresponding path program 1 times [2019-12-27 17:45:25,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:25,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294356082] [2019-12-27 17:45:25,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:25,598 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-27 17:45:25,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294356082] [2019-12-27 17:45:25,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:25,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:45:25,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1606773904] [2019-12-27 17:45:25,603 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:25,605 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:25,613 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 17:45:25,613 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:25,664 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:45:25,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:45:25,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:25,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:45:25,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:45:25,665 INFO L87 Difference]: Start difference. First operand 1490 states and 3702 transitions. Second operand 5 states. [2019-12-27 17:45:25,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:25,884 INFO L93 Difference]: Finished difference Result 1934 states and 4662 transitions. [2019-12-27 17:45:25,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:45:25,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 17:45:25,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:25,896 INFO L225 Difference]: With dead ends: 1934 [2019-12-27 17:45:25,897 INFO L226 Difference]: Without dead ends: 1919 [2019-12-27 17:45:25,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:45:25,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2019-12-27 17:45:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1755. [2019-12-27 17:45:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1755 states. [2019-12-27 17:45:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 4270 transitions. [2019-12-27 17:45:25,952 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 4270 transitions. Word has length 14 [2019-12-27 17:45:25,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:25,956 INFO L462 AbstractCegarLoop]: Abstraction has 1755 states and 4270 transitions. [2019-12-27 17:45:25,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:45:25,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 4270 transitions. [2019-12-27 17:45:25,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:45:25,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:25,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:45:25,959 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:25,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:25,960 INFO L82 PathProgramCache]: Analyzing trace with hash -564373810, now seen corresponding path program 1 times [2019-12-27 17:45:25,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:25,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007345975] [2019-12-27 17:45:25,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:26,068 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-27 17:45:26,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007345975] [2019-12-27 17:45:26,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:26,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:45:26,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1671913219] [2019-12-27 17:45:26,072 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:26,073 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:26,077 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 17:45:26,077 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:26,104 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:45:26,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:45:26,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:26,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:45:26,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:45:26,106 INFO L87 Difference]: Start difference. First operand 1755 states and 4270 transitions. Second operand 5 states. [2019-12-27 17:45:26,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:26,319 INFO L93 Difference]: Finished difference Result 2157 states and 5151 transitions. [2019-12-27 17:45:26,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:45:26,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 17:45:26,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:26,333 INFO L225 Difference]: With dead ends: 2157 [2019-12-27 17:45:26,333 INFO L226 Difference]: Without dead ends: 2136 [2019-12-27 17:45:26,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:45:26,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2019-12-27 17:45:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 1779. [2019-12-27 17:45:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-12-27 17:45:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 4301 transitions. [2019-12-27 17:45:26,381 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 4301 transitions. Word has length 14 [2019-12-27 17:45:26,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:26,381 INFO L462 AbstractCegarLoop]: Abstraction has 1779 states and 4301 transitions. [2019-12-27 17:45:26,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:45:26,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 4301 transitions. [2019-12-27 17:45:26,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 17:45:26,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:26,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:45:26,385 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:26,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:26,385 INFO L82 PathProgramCache]: Analyzing trace with hash -375021524, now seen corresponding path program 1 times [2019-12-27 17:45:26,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:26,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890210023] [2019-12-27 17:45:26,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:26,476 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-27 17:45:26,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890210023] [2019-12-27 17:45:26,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:26,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:45:26,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1215837600] [2019-12-27 17:45:26,477 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:26,482 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:26,494 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 86 transitions. [2019-12-27 17:45:26,494 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:26,511 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:45:26,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:45:26,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:26,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:45:26,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:45:26,512 INFO L87 Difference]: Start difference. First operand 1779 states and 4301 transitions. Second operand 6 states. [2019-12-27 17:45:26,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:26,568 INFO L93 Difference]: Finished difference Result 923 states and 2095 transitions. [2019-12-27 17:45:26,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:45:26,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 17:45:26,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:26,573 INFO L225 Difference]: With dead ends: 923 [2019-12-27 17:45:26,574 INFO L226 Difference]: Without dead ends: 819 [2019-12-27 17:45:26,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:45:26,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-12-27 17:45:26,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 774. [2019-12-27 17:45:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-12-27 17:45:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1752 transitions. [2019-12-27 17:45:26,630 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1752 transitions. Word has length 26 [2019-12-27 17:45:26,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:26,631 INFO L462 AbstractCegarLoop]: Abstraction has 774 states and 1752 transitions. [2019-12-27 17:45:26,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:45:26,632 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1752 transitions. [2019-12-27 17:45:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 17:45:26,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:26,634 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-27 17:45:26,634 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:26,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:26,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1687726867, now seen corresponding path program 1 times [2019-12-27 17:45:26,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:26,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433575286] [2019-12-27 17:45:26,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:26,767 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-27 17:45:26,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433575286] [2019-12-27 17:45:26,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:26,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:45:26,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2081122813] [2019-12-27 17:45:26,768 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:26,779 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:26,811 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 131 transitions. [2019-12-27 17:45:26,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:26,813 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:45:26,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:45:26,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:26,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:45:26,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:45:26,814 INFO L87 Difference]: Start difference. First operand 774 states and 1752 transitions. Second operand 6 states. [2019-12-27 17:45:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:27,050 INFO L93 Difference]: Finished difference Result 1960 states and 4402 transitions. [2019-12-27 17:45:27,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:45:27,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 17:45:27,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:27,060 INFO L225 Difference]: With dead ends: 1960 [2019-12-27 17:45:27,060 INFO L226 Difference]: Without dead ends: 1312 [2019-12-27 17:45:27,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:45:27,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-12-27 17:45:27,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 846. [2019-12-27 17:45:27,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-12-27 17:45:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1920 transitions. [2019-12-27 17:45:27,089 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1920 transitions. Word has length 41 [2019-12-27 17:45:27,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:27,089 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1920 transitions. [2019-12-27 17:45:27,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:45:27,089 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1920 transitions. [2019-12-27 17:45:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 17:45:27,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:27,093 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-27 17:45:27,093 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:27,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:27,093 INFO L82 PathProgramCache]: Analyzing trace with hash -2071793039, now seen corresponding path program 2 times [2019-12-27 17:45:27,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:27,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341602129] [2019-12-27 17:45:27,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:27,158 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-27 17:45:27,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341602129] [2019-12-27 17:45:27,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:27,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:45:27,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [254275233] [2019-12-27 17:45:27,159 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:27,168 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:27,207 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 93 states and 132 transitions. [2019-12-27 17:45:27,207 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:27,208 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:45:27,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:45:27,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:27,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:45:27,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:45:27,210 INFO L87 Difference]: Start difference. First operand 846 states and 1920 transitions. Second operand 4 states. [2019-12-27 17:45:27,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:27,230 INFO L93 Difference]: Finished difference Result 1326 states and 3034 transitions. [2019-12-27 17:45:27,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:45:27,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-27 17:45:27,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:27,233 INFO L225 Difference]: With dead ends: 1326 [2019-12-27 17:45:27,234 INFO L226 Difference]: Without dead ends: 500 [2019-12-27 17:45:27,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-27 17:45:27,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-12-27 17:45:27,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2019-12-27 17:45:27,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-27 17:45:27,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1147 transitions. [2019-12-27 17:45:27,245 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1147 transitions. Word has length 41 [2019-12-27 17:45:27,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:27,246 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 1147 transitions. [2019-12-27 17:45:27,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:45:27,246 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1147 transitions. [2019-12-27 17:45:27,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 17:45:27,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:27,247 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-27 17:45:27,248 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:27,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:27,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1825813411, now seen corresponding path program 3 times [2019-12-27 17:45:27,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:27,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625238362] [2019-12-27 17:45:27,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:27,321 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-27 17:45:27,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625238362] [2019-12-27 17:45:27,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:27,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:45:27,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1380147359] [2019-12-27 17:45:27,322 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:27,331 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:27,368 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 93 transitions. [2019-12-27 17:45:27,369 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:27,391 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:45:27,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:45:27,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:27,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:45:27,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:45:27,393 INFO L87 Difference]: Start difference. First operand 500 states and 1147 transitions. Second operand 7 states. [2019-12-27 17:45:27,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:27,599 INFO L93 Difference]: Finished difference Result 872 states and 1959 transitions. [2019-12-27 17:45:27,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:45:27,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 17:45:27,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:27,602 INFO L225 Difference]: With dead ends: 872 [2019-12-27 17:45:27,602 INFO L226 Difference]: Without dead ends: 584 [2019-12-27 17:45:27,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:45:27,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-12-27 17:45:27,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 516. [2019-12-27 17:45:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-12-27 17:45:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1177 transitions. [2019-12-27 17:45:27,615 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 1177 transitions. Word has length 41 [2019-12-27 17:45:27,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:27,615 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 1177 transitions. [2019-12-27 17:45:27,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:45:27,615 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 1177 transitions. [2019-12-27 17:45:27,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 17:45:27,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:27,617 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-27 17:45:27,618 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:27,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:27,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1484678691, now seen corresponding path program 4 times [2019-12-27 17:45:27,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:27,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369548904] [2019-12-27 17:45:27,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:27,719 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-27 17:45:27,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369548904] [2019-12-27 17:45:27,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:27,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:45:27,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2131170561] [2019-12-27 17:45:27,721 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:27,730 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:27,766 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 118 transitions. [2019-12-27 17:45:27,766 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:27,792 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:45:27,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:45:27,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:27,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:45:27,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:45:27,793 INFO L87 Difference]: Start difference. First operand 516 states and 1177 transitions. Second operand 6 states. [2019-12-27 17:45:28,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:28,169 INFO L93 Difference]: Finished difference Result 846 states and 1862 transitions. [2019-12-27 17:45:28,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:45:28,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 17:45:28,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:28,174 INFO L225 Difference]: With dead ends: 846 [2019-12-27 17:45:28,174 INFO L226 Difference]: Without dead ends: 834 [2019-12-27 17:45:28,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:45:28,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2019-12-27 17:45:28,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 791. [2019-12-27 17:45:28,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-12-27 17:45:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1759 transitions. [2019-12-27 17:45:28,192 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1759 transitions. Word has length 41 [2019-12-27 17:45:28,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:28,192 INFO L462 AbstractCegarLoop]: Abstraction has 791 states and 1759 transitions. [2019-12-27 17:45:28,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:45:28,192 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1759 transitions. [2019-12-27 17:45:28,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 17:45:28,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:28,195 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-27 17:45:28,195 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:28,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:28,195 INFO L82 PathProgramCache]: Analyzing trace with hash 577447219, now seen corresponding path program 5 times [2019-12-27 17:45:28,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:28,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827922648] [2019-12-27 17:45:28,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:28,285 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-27 17:45:28,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827922648] [2019-12-27 17:45:28,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:28,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:45:28,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1989260497] [2019-12-27 17:45:28,286 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:28,296 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:28,322 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 88 transitions. [2019-12-27 17:45:28,322 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:28,323 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:45:28,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:45:28,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:28,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:45:28,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:45:28,325 INFO L87 Difference]: Start difference. First operand 791 states and 1759 transitions. Second operand 3 states. [2019-12-27 17:45:28,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:28,337 INFO L93 Difference]: Finished difference Result 789 states and 1754 transitions. [2019-12-27 17:45:28,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:45:28,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 17:45:28,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:28,342 INFO L225 Difference]: With dead ends: 789 [2019-12-27 17:45:28,342 INFO L226 Difference]: Without dead ends: 789 [2019-12-27 17:45:28,343 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-27 17:45:28,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-12-27 17:45:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 697. [2019-12-27 17:45:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-12-27 17:45:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1570 transitions. [2019-12-27 17:45:28,359 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1570 transitions. Word has length 41 [2019-12-27 17:45:28,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:28,360 INFO L462 AbstractCegarLoop]: Abstraction has 697 states and 1570 transitions. [2019-12-27 17:45:28,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:45:28,360 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1570 transitions. [2019-12-27 17:45:28,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 17:45:28,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:28,362 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-27 17:45:28,362 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:28,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:28,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1605159892, now seen corresponding path program 1 times [2019-12-27 17:45:28,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:28,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511945776] [2019-12-27 17:45:28,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:45:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:45:28,478 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:45:28,479 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:45:28,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< 0 |v_#StackHeapBarrier_12|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1651~0.base_19|)) (= 0 v_~y$w_buff0~0_571) (= v_~z~0_33 0) (= 0 v_~y$r_buff0_thd2~0_124) (= 0 v_~y$flush_delayed~0_47) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_56 0) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t1651~0.base_19| 1)) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_321 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= v_~weak$$choice2~0_156 0) (= v_~y~0_145 0) (= v_~y$w_buff1_used~0_548 0) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_cnt~0_85) (= v_~y$r_buff1_thd0~0_115 0) (= v_~y$r_buff1_thd1~0_238 0) (= v_~y$mem_tmp~0_18 0) (= 0 v_~y$r_buff1_thd2~0_86) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1651~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1651~0.base_19|) |v_ULTIMATE.start_main_~#t1651~0.offset_17| 0))) (= v_~y$w_buff0_used~0_794 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (= v_~y$r_buff0_thd0~0_127 0) (= |v_ULTIMATE.start_main_~#t1651~0.offset_17| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1651~0.base_19|) (= v_~main$tmp_guard0~0_32 0) (= 0 v_~__unbuffered_p1_EAX~0_56) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~x~0_36 0) (= v_~y$w_buff1~0_385 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1651~0.base_19| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_794, ULTIMATE.start_main_~#t1651~0.base=|v_ULTIMATE.start_main_~#t1651~0.base_19|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_15|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t1652~0.base=|v_ULTIMATE.start_main_~#t1652~0.base_22|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_238, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_571, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_321, ~y$flush_delayed~0=v_~y$flush_delayed~0_47, #length=|v_#length_13|, ~y~0=v_~y~0_145, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_56, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_68|, ULTIMATE.start_main_~#t1652~0.offset=|v_ULTIMATE.start_main_~#t1652~0.offset_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_86|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_120|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_86, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_385, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1651~0.offset=|v_ULTIMATE.start_main_~#t1651~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_127, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, ~x~0=v_~x~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1651~0.base, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ULTIMATE.start_main_~#t1652~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1652~0.offset, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1651~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:45:28,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1652~0.base_9| 1)) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1652~0.base_9|)) (= |v_ULTIMATE.start_main_~#t1652~0.offset_8| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1652~0.base_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1652~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1652~0.base_9|) |v_ULTIMATE.start_main_~#t1652~0.offset_8| 1))) (not (= |v_ULTIMATE.start_main_~#t1652~0.base_9| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1652~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1652~0.base=|v_ULTIMATE.start_main_~#t1652~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1652~0.offset=|v_ULTIMATE.start_main_~#t1652~0.offset_8|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1652~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1652~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 17:45:28,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_76 0)) (= v_~z~0_12 1) (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff1_thd2~0_35) (= v_~y$r_buff0_thd0~0_50 v_~y$r_buff1_thd0~0_31) (= v_~y$r_buff0_thd1~0_125 v_~y$r_buff1_thd1~0_69) (= v_~__unbuffered_p1_EBX~0_15 v_~x~0_14) (= v_~y$r_buff0_thd2~0_56 1) (= v_~z~0_12 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_76, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~x~0=v_~x~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_35, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~z~0=v_~z~0_12, ~x~0=v_~x~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 17:45:28,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In216593265 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In216593265 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out216593265|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In216593265 |P1Thread1of1ForFork0_#t~ite28_Out216593265|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In216593265, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In216593265} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In216593265, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In216593265, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out216593265|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 17:45:28,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1694335324 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1694335324 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1694335324 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1694335324 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out1694335324| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite29_Out1694335324| ~y$w_buff1_used~0_In1694335324) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1694335324, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1694335324, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1694335324, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1694335324} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1694335324, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1694335324, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1694335324, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1694335324|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1694335324} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 17:45:28,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1614679430 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1614679430 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd2~0_Out-1614679430 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_Out-1614679430 ~y$r_buff0_thd2~0_In-1614679430)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1614679430, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1614679430} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1614679430, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1614679430|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1614679430} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 17:45:28,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L742-->L742-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1782876848 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite17_In1782876848| |P0Thread1of1ForFork1_#t~ite17_Out1782876848|) (= ~y$w_buff1_used~0_In1782876848 |P0Thread1of1ForFork1_#t~ite18_Out1782876848|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1782876848 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1782876848 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd1~0_In1782876848 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1782876848 256)))) (= ~y$w_buff1_used~0_In1782876848 |P0Thread1of1ForFork1_#t~ite17_Out1782876848|) .cse0 (= |P0Thread1of1ForFork1_#t~ite17_Out1782876848| |P0Thread1of1ForFork1_#t~ite18_Out1782876848|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1782876848, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1782876848, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1782876848, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In1782876848|, ~weak$$choice2~0=~weak$$choice2~0_In1782876848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1782876848} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1782876848, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1782876848, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1782876848, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out1782876848|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out1782876848|, ~weak$$choice2~0=~weak$$choice2~0_In1782876848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1782876848} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 17:45:28,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_97 v_~y$r_buff0_thd1~0_96) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_14|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_15|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:45:28,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y~0_27 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_11|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 17:45:28,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1256181331 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1256181331 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1256181331 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1256181331 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-1256181331| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite31_Out-1256181331| ~y$r_buff1_thd2~0_In-1256181331) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1256181331, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1256181331, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1256181331, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1256181331} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1256181331, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1256181331, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1256181331|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1256181331, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1256181331} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 17:45:28,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite31_34| v_~y$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 17:45:28,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_97 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_21 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:45:28,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-804823792 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-804823792 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite34_Out-804823792| ~y$w_buff1~0_In-804823792) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-804823792 |ULTIMATE.start_main_#t~ite34_Out-804823792|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-804823792, ~y~0=~y~0_In-804823792, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-804823792, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-804823792} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-804823792, ~y~0=~y~0_In-804823792, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-804823792, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-804823792|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-804823792} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 17:45:28,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 17:45:28,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-106681027 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-106681027 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out-106681027| ~y$w_buff0_used~0_In-106681027) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out-106681027| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-106681027, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-106681027} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-106681027, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-106681027, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-106681027|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 17:45:28,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-758412271 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-758412271 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-758412271 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-758412271 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-758412271 |ULTIMATE.start_main_#t~ite37_Out-758412271|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite37_Out-758412271|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-758412271, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-758412271, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-758412271, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-758412271} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-758412271, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-758412271, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-758412271|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-758412271, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-758412271} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 17:45:28,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-757659245 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-757659245 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-757659245| ~y$r_buff0_thd0~0_In-757659245)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out-757659245|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-757659245, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-757659245} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-757659245, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-757659245, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-757659245|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 17:45:28,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1110822667 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1110822667 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1110822667 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1110822667 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out1110822667| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In1110822667 |ULTIMATE.start_main_#t~ite39_Out1110822667|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1110822667, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1110822667, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1110822667, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1110822667} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1110822667, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1110822667|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1110822667, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1110822667, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1110822667} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 17:45:28,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_15 0) (= 1 v_~__unbuffered_p1_EAX~0_32) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_15 256)) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p0_EAX~0_40) (= |v_ULTIMATE.start_main_#t~ite39_34| v_~y$r_buff1_thd0~0_70)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_34|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:45:28,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:45:28 BasicIcfg [2019-12-27 17:45:28,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:45:28,608 INFO L168 Benchmark]: Toolchain (without parser) took 11916.30 ms. Allocated memory was 143.7 MB in the beginning and 383.3 MB in the end (delta: 239.6 MB). Free memory was 101.4 MB in the beginning and 80.8 MB in the end (delta: 20.6 MB). Peak memory consumption was 260.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:45:28,609 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 143.7 MB. Free memory was 121.3 MB in the beginning and 121.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 17:45:28,613 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.86 ms. Allocated memory was 143.7 MB in the beginning and 202.4 MB in the end (delta: 58.7 MB). Free memory was 101.0 MB in the beginning and 156.9 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2019-12-27 17:45:28,613 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.25 ms. Allocated memory is still 202.4 MB. Free memory was 156.9 MB in the beginning and 154.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:45:28,614 INFO L168 Benchmark]: Boogie Preprocessor took 37.16 ms. Allocated memory is still 202.4 MB. Free memory was 154.9 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:45:28,615 INFO L168 Benchmark]: RCFGBuilder took 706.06 ms. Allocated memory is still 202.4 MB. Free memory was 152.2 MB in the beginning and 111.0 MB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:45:28,619 INFO L168 Benchmark]: TraceAbstraction took 10351.70 ms. Allocated memory was 202.4 MB in the beginning and 383.3 MB in the end (delta: 180.9 MB). Free memory was 111.0 MB in the beginning and 80.8 MB in the end (delta: 30.2 MB). Peak memory consumption was 211.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:45:28,626 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.20 ms. Allocated memory is still 143.7 MB. Free memory was 121.3 MB in the beginning and 121.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 755.86 ms. Allocated memory was 143.7 MB in the beginning and 202.4 MB in the end (delta: 58.7 MB). Free memory was 101.0 MB in the beginning and 156.9 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.25 ms. Allocated memory is still 202.4 MB. Free memory was 156.9 MB in the beginning and 154.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.16 ms. Allocated memory is still 202.4 MB. Free memory was 154.9 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 706.06 ms. Allocated memory is still 202.4 MB. Free memory was 152.2 MB in the beginning and 111.0 MB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10351.70 ms. Allocated memory was 202.4 MB in the beginning and 383.3 MB in the end (delta: 180.9 MB). Free memory was 111.0 MB in the beginning and 80.8 MB in the end (delta: 30.2 MB). Peak memory consumption was 211.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 137 ProgramPointsBefore, 67 ProgramPointsAfterwards, 165 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 20 ChoiceCompositions, 4326 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 84 SemBasedMoverChecksPositive, 180 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 39043 CheckedPairsTotal, 99 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1651, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1652, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.0s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1285 SDtfs, 1137 SDslu, 2697 SDs, 0 SdLazy, 995 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6812occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 1731 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 43148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...