/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/mix040_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:58:35,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:58:35,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:58:35,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:58:35,358 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:58:35,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:58:35,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:58:35,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:58:35,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:58:35,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:58:35,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:58:35,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:58:35,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:58:35,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:58:35,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:58:35,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:58:35,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:58:35,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:58:35,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:58:35,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:58:35,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:58:35,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:58:35,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:58:35,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:58:35,389 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:58:35,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:58:35,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:58:35,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:58:35,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:58:35,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:58:35,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:58:35,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:58:35,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:58:35,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:58:35,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:58:35,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:58:35,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:58:35,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:58:35,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:58:35,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:58:35,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:58:35,410 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 16:58:35,438 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:58:35,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:58:35,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:58:35,443 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:58:35,443 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:58:35,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:58:35,444 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:58:35,444 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:58:35,444 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:58:35,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:58:35,446 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:58:35,446 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:58:35,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:58:35,446 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:58:35,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:58:35,447 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:58:35,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:58:35,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:58:35,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:58:35,448 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:58:35,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:58:35,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:58:35,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:58:35,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:58:35,449 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:58:35,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:58:35,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:58:35,449 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:58:35,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:58:35,450 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:58:35,451 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:58:35,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:58:35,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:58:35,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:58:35,761 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:58:35,762 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:58:35,763 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_power.opt.i [2019-12-27 16:58:35,836 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b5f1e533/2339ffed3be5446282568ababa7cbbcf/FLAGbbe12e6f2 [2019-12-27 16:58:36,358 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:58:36,359 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_power.opt.i [2019-12-27 16:58:36,373 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b5f1e533/2339ffed3be5446282568ababa7cbbcf/FLAGbbe12e6f2 [2019-12-27 16:58:36,631 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b5f1e533/2339ffed3be5446282568ababa7cbbcf [2019-12-27 16:58:36,643 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:58:36,645 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:58:36,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:58:36,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:58:36,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:58:36,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:58:36" (1/1) ... [2019-12-27 16:58:36,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6943ffe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:36, skipping insertion in model container [2019-12-27 16:58:36,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:58:36" (1/1) ... [2019-12-27 16:58:36,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:58:36,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:58:37,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:58:37,389 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:58:37,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:58:37,536 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:58:37,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:37 WrapperNode [2019-12-27 16:58:37,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:58:37,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:58:37,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:58:37,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:58:37,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:37" (1/1) ... [2019-12-27 16:58:37,570 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:37" (1/1) ... [2019-12-27 16:58:37,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:58:37,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:58:37,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:58:37,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:58:37,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:37" (1/1) ... [2019-12-27 16:58:37,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:37" (1/1) ... [2019-12-27 16:58:37,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:37" (1/1) ... [2019-12-27 16:58:37,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:37" (1/1) ... [2019-12-27 16:58:37,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:37" (1/1) ... [2019-12-27 16:58:37,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:37" (1/1) ... [2019-12-27 16:58:37,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:37" (1/1) ... [2019-12-27 16:58:37,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:58:37,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:58:37,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:58:37,666 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:58:37,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:37" (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 16:58:37,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:58:37,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:58:37,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:58:37,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:58:37,722 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:58:37,722 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:58:37,722 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:58:37,722 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:58:37,723 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:58:37,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:58:37,723 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 16:58:37,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 16:58:37,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:58:37,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:58:37,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:58:37,726 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 16:58:38,484 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:58:38,484 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:58:38,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:58:38 BoogieIcfgContainer [2019-12-27 16:58:38,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:58:38,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:58:38,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:58:38,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:58:38,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:58:36" (1/3) ... [2019-12-27 16:58:38,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b6c7ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:58:38, skipping insertion in model container [2019-12-27 16:58:38,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:58:37" (2/3) ... [2019-12-27 16:58:38,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b6c7ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:58:38, skipping insertion in model container [2019-12-27 16:58:38,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:58:38" (3/3) ... [2019-12-27 16:58:38,494 INFO L109 eAbstractionObserver]: Analyzing ICFG mix040_power.opt.i [2019-12-27 16:58:38,502 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:58:38,502 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:58:38,515 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:58:38,516 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:58:38,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,566 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,566 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,571 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,571 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,621 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,621 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,621 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,622 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,622 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,622 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,623 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,623 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,623 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,635 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,637 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,645 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,647 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,649 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,649 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,652 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,653 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,655 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,655 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:58:38,670 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 16:58:38,689 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:58:38,689 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:58:38,689 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:58:38,689 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:58:38,690 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:58:38,690 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:58:38,690 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:58:38,690 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:58:38,707 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 191 transitions [2019-12-27 16:58:38,709 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-27 16:58:38,806 INFO L132 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-27 16:58:38,807 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:58:38,824 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 16:58:38,851 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-27 16:58:38,904 INFO L132 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-27 16:58:38,905 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:58:38,913 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 16:58:38,932 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 16:58:38,933 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:58:44,206 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 16:58:44,381 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 16:58:44,398 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46301 [2019-12-27 16:58:44,399 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-27 16:58:44,402 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 83 transitions [2019-12-27 16:58:46,124 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27254 states. [2019-12-27 16:58:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 27254 states. [2019-12-27 16:58:46,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 16:58:46,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:46,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:46,133 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:46,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:46,138 INFO L82 PathProgramCache]: Analyzing trace with hash -2114616633, now seen corresponding path program 1 times [2019-12-27 16:58:46,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:46,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995985181] [2019-12-27 16:58:46,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:46,430 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 16:58:46,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995985181] [2019-12-27 16:58:46,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:46,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:58:46,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2052243090] [2019-12-27 16:58:46,433 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:46,441 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:46,463 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 16:58:46,464 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:46,467 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:58:46,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:58:46,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:46,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:58:46,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:58:46,482 INFO L87 Difference]: Start difference. First operand 27254 states. Second operand 3 states. [2019-12-27 16:58:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:47,230 INFO L93 Difference]: Finished difference Result 26518 states and 112736 transitions. [2019-12-27 16:58:47,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:58:47,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 16:58:47,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:47,497 INFO L225 Difference]: With dead ends: 26518 [2019-12-27 16:58:47,498 INFO L226 Difference]: Without dead ends: 24958 [2019-12-27 16:58:47,499 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 16:58:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24958 states. [2019-12-27 16:58:49,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24958 to 24958. [2019-12-27 16:58:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24958 states. [2019-12-27 16:58:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24958 states to 24958 states and 105960 transitions. [2019-12-27 16:58:49,888 INFO L78 Accepts]: Start accepts. Automaton has 24958 states and 105960 transitions. Word has length 9 [2019-12-27 16:58:49,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:49,889 INFO L462 AbstractCegarLoop]: Abstraction has 24958 states and 105960 transitions. [2019-12-27 16:58:49,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:58:49,890 INFO L276 IsEmpty]: Start isEmpty. Operand 24958 states and 105960 transitions. [2019-12-27 16:58:49,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 16:58:49,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:49,904 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:49,904 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:49,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:49,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1982620494, now seen corresponding path program 1 times [2019-12-27 16:58:49,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:49,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243603949] [2019-12-27 16:58:49,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:50,032 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 16:58:50,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243603949] [2019-12-27 16:58:50,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:50,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:58:50,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2109433060] [2019-12-27 16:58:50,034 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:50,035 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:50,040 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 16:58:50,041 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:50,041 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:58:50,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:58:50,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:50,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:58:50,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:58:50,043 INFO L87 Difference]: Start difference. First operand 24958 states and 105960 transitions. Second operand 3 states. [2019-12-27 16:58:50,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:50,526 INFO L93 Difference]: Finished difference Result 19953 states and 78654 transitions. [2019-12-27 16:58:50,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:58:50,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 16:58:50,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:50,624 INFO L225 Difference]: With dead ends: 19953 [2019-12-27 16:58:50,624 INFO L226 Difference]: Without dead ends: 19953 [2019-12-27 16:58:50,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:58:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19953 states. [2019-12-27 16:58:52,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19953 to 19953. [2019-12-27 16:58:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19953 states. [2019-12-27 16:58:52,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19953 states to 19953 states and 78654 transitions. [2019-12-27 16:58:52,624 INFO L78 Accepts]: Start accepts. Automaton has 19953 states and 78654 transitions. Word has length 15 [2019-12-27 16:58:52,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:52,625 INFO L462 AbstractCegarLoop]: Abstraction has 19953 states and 78654 transitions. [2019-12-27 16:58:52,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:58:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 19953 states and 78654 transitions. [2019-12-27 16:58:52,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:58:52,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:52,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:52,629 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:52,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:52,629 INFO L82 PathProgramCache]: Analyzing trace with hash 832904726, now seen corresponding path program 1 times [2019-12-27 16:58:52,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:52,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264699915] [2019-12-27 16:58:52,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:52,700 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 16:58:52,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264699915] [2019-12-27 16:58:52,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:52,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:58:52,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1634337423] [2019-12-27 16:58:52,701 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:52,707 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:52,710 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 24 transitions. [2019-12-27 16:58:52,711 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:52,712 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:58:52,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:58:52,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:52,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:58:52,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:58:52,713 INFO L87 Difference]: Start difference. First operand 19953 states and 78654 transitions. Second operand 4 states. [2019-12-27 16:58:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:52,985 INFO L93 Difference]: Finished difference Result 9211 states and 30743 transitions. [2019-12-27 16:58:52,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:58:52,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:58:52,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:53,020 INFO L225 Difference]: With dead ends: 9211 [2019-12-27 16:58:53,020 INFO L226 Difference]: Without dead ends: 9211 [2019-12-27 16:58:53,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:58:53,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9211 states. [2019-12-27 16:58:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9211 to 9211. [2019-12-27 16:58:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9211 states. [2019-12-27 16:58:53,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9211 states to 9211 states and 30743 transitions. [2019-12-27 16:58:53,276 INFO L78 Accepts]: Start accepts. Automaton has 9211 states and 30743 transitions. Word has length 16 [2019-12-27 16:58:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:53,277 INFO L462 AbstractCegarLoop]: Abstraction has 9211 states and 30743 transitions. [2019-12-27 16:58:53,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:58:53,277 INFO L276 IsEmpty]: Start isEmpty. Operand 9211 states and 30743 transitions. [2019-12-27 16:58:53,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 16:58:53,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:53,280 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:53,281 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:53,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:53,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1159456736, now seen corresponding path program 1 times [2019-12-27 16:58:53,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:53,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147807426] [2019-12-27 16:58:53,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:53,395 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 16:58:53,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147807426] [2019-12-27 16:58:53,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:53,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:58:53,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1286515533] [2019-12-27 16:58:53,397 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:53,401 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:53,408 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 33 transitions. [2019-12-27 16:58:53,410 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:53,458 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:58:53,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:58:53,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:53,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:58:53,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:58:53,460 INFO L87 Difference]: Start difference. First operand 9211 states and 30743 transitions. Second operand 6 states. [2019-12-27 16:58:53,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:53,525 INFO L93 Difference]: Finished difference Result 2716 states and 8200 transitions. [2019-12-27 16:58:53,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:58:53,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 16:58:53,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:53,533 INFO L225 Difference]: With dead ends: 2716 [2019-12-27 16:58:53,533 INFO L226 Difference]: Without dead ends: 2716 [2019-12-27 16:58:53,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:58:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2019-12-27 16:58:53,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2716. [2019-12-27 16:58:53,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2019-12-27 16:58:53,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 8200 transitions. [2019-12-27 16:58:53,593 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 8200 transitions. Word has length 17 [2019-12-27 16:58:53,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:53,594 INFO L462 AbstractCegarLoop]: Abstraction has 2716 states and 8200 transitions. [2019-12-27 16:58:53,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:58:53,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 8200 transitions. [2019-12-27 16:58:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 16:58:53,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:53,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:53,596 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:53,597 INFO L82 PathProgramCache]: Analyzing trace with hash 965433528, now seen corresponding path program 1 times [2019-12-27 16:58:53,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:53,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637510154] [2019-12-27 16:58:53,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:53,715 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 16:58:53,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637510154] [2019-12-27 16:58:53,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:53,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:58:53,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [187809915] [2019-12-27 16:58:53,717 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:53,720 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:53,728 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 16:58:53,728 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:53,769 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:58:53,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:58:53,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:53,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:58:53,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:58:53,771 INFO L87 Difference]: Start difference. First operand 2716 states and 8200 transitions. Second operand 5 states. [2019-12-27 16:58:53,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:53,981 INFO L93 Difference]: Finished difference Result 3607 states and 10783 transitions. [2019-12-27 16:58:53,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:58:53,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 16:58:53,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:53,989 INFO L225 Difference]: With dead ends: 3607 [2019-12-27 16:58:53,989 INFO L226 Difference]: Without dead ends: 3607 [2019-12-27 16:58:53,990 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 16:58:54,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2019-12-27 16:58:54,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3415. [2019-12-27 16:58:54,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3415 states. [2019-12-27 16:58:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 10347 transitions. [2019-12-27 16:58:54,082 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 10347 transitions. Word has length 18 [2019-12-27 16:58:54,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:54,083 INFO L462 AbstractCegarLoop]: Abstraction has 3415 states and 10347 transitions. [2019-12-27 16:58:54,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:58:54,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 10347 transitions. [2019-12-27 16:58:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 16:58:54,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:54,094 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] [2019-12-27 16:58:54,094 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:54,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:54,094 INFO L82 PathProgramCache]: Analyzing trace with hash -792380239, now seen corresponding path program 1 times [2019-12-27 16:58:54,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:54,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841261352] [2019-12-27 16:58:54,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:54,207 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 16:58:54,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841261352] [2019-12-27 16:58:54,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:54,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:58:54,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [379094894] [2019-12-27 16:58:54,210 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:54,220 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:54,231 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 52 transitions. [2019-12-27 16:58:54,231 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:54,231 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:58:54,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:58:54,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:54,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:58:54,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:58:54,233 INFO L87 Difference]: Start difference. First operand 3415 states and 10347 transitions. Second operand 3 states. [2019-12-27 16:58:54,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:54,263 INFO L93 Difference]: Finished difference Result 5436 states and 15699 transitions. [2019-12-27 16:58:54,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:58:54,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-27 16:58:54,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:54,270 INFO L225 Difference]: With dead ends: 5436 [2019-12-27 16:58:54,270 INFO L226 Difference]: Without dead ends: 3574 [2019-12-27 16:58:54,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:58:54,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2019-12-27 16:58:54,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 3488. [2019-12-27 16:58:54,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3488 states. [2019-12-27 16:58:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 9360 transitions. [2019-12-27 16:58:54,473 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 9360 transitions. Word has length 32 [2019-12-27 16:58:54,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:54,474 INFO L462 AbstractCegarLoop]: Abstraction has 3488 states and 9360 transitions. [2019-12-27 16:58:54,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:58:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 9360 transitions. [2019-12-27 16:58:54,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 16:58:54,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:54,482 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] [2019-12-27 16:58:54,482 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:54,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:54,483 INFO L82 PathProgramCache]: Analyzing trace with hash -617388800, now seen corresponding path program 1 times [2019-12-27 16:58:54,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:54,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979043124] [2019-12-27 16:58:54,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:54,525 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 16:58:54,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979043124] [2019-12-27 16:58:54,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:54,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:58:54,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1216856912] [2019-12-27 16:58:54,526 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:54,533 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:54,591 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 155 states and 332 transitions. [2019-12-27 16:58:54,592 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:54,627 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 16:58:54,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:58:54,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:54,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:58:54,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:58:54,628 INFO L87 Difference]: Start difference. First operand 3488 states and 9360 transitions. Second operand 5 states. [2019-12-27 16:58:54,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:54,715 INFO L93 Difference]: Finished difference Result 5140 states and 13647 transitions. [2019-12-27 16:58:54,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:58:54,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-27 16:58:54,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:54,723 INFO L225 Difference]: With dead ends: 5140 [2019-12-27 16:58:54,723 INFO L226 Difference]: Without dead ends: 5140 [2019-12-27 16:58:54,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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 16:58:54,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5140 states. [2019-12-27 16:58:54,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5140 to 4152. [2019-12-27 16:58:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4152 states. [2019-12-27 16:58:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 11165 transitions. [2019-12-27 16:58:54,807 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 11165 transitions. Word has length 32 [2019-12-27 16:58:54,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:54,807 INFO L462 AbstractCegarLoop]: Abstraction has 4152 states and 11165 transitions. [2019-12-27 16:58:54,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:58:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 11165 transitions. [2019-12-27 16:58:54,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 16:58:54,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:54,816 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] [2019-12-27 16:58:54,816 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:54,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:54,817 INFO L82 PathProgramCache]: Analyzing trace with hash 937445460, now seen corresponding path program 1 times [2019-12-27 16:58:54,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:54,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174738935] [2019-12-27 16:58:54,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:54,857 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 16:58:54,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174738935] [2019-12-27 16:58:54,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:54,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:58:54,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [360913865] [2019-12-27 16:58:54,859 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:54,865 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:54,925 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 155 states and 332 transitions. [2019-12-27 16:58:54,925 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:54,960 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 16:58:54,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:58:54,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:54,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:58:54,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:58:54,961 INFO L87 Difference]: Start difference. First operand 4152 states and 11165 transitions. Second operand 5 states. [2019-12-27 16:58:55,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:55,039 INFO L93 Difference]: Finished difference Result 5140 states and 13308 transitions. [2019-12-27 16:58:55,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:58:55,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-27 16:58:55,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:55,047 INFO L225 Difference]: With dead ends: 5140 [2019-12-27 16:58:55,047 INFO L226 Difference]: Without dead ends: 5140 [2019-12-27 16:58:55,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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 16:58:55,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5140 states. [2019-12-27 16:58:55,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5140 to 4108. [2019-12-27 16:58:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4108 states. [2019-12-27 16:58:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4108 states to 4108 states and 10730 transitions. [2019-12-27 16:58:55,150 INFO L78 Accepts]: Start accepts. Automaton has 4108 states and 10730 transitions. Word has length 32 [2019-12-27 16:58:55,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:55,151 INFO L462 AbstractCegarLoop]: Abstraction has 4108 states and 10730 transitions. [2019-12-27 16:58:55,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:58:55,151 INFO L276 IsEmpty]: Start isEmpty. Operand 4108 states and 10730 transitions. [2019-12-27 16:58:55,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 16:58:55,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:55,163 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] [2019-12-27 16:58:55,163 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:55,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:55,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1469218903, now seen corresponding path program 1 times [2019-12-27 16:58:55,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:55,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497623805] [2019-12-27 16:58:55,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:55,403 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 16:58:55,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497623805] [2019-12-27 16:58:55,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:55,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:58:55,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [435865292] [2019-12-27 16:58:55,404 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:55,411 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:55,463 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 155 states and 332 transitions. [2019-12-27 16:58:55,463 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:55,505 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:58:55,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:58:55,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:55,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:58:55,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:58:55,507 INFO L87 Difference]: Start difference. First operand 4108 states and 10730 transitions. Second operand 8 states. [2019-12-27 16:58:55,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:55,580 INFO L93 Difference]: Finished difference Result 3096 states and 8255 transitions. [2019-12-27 16:58:55,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:58:55,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 16:58:55,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:55,583 INFO L225 Difference]: With dead ends: 3096 [2019-12-27 16:58:55,584 INFO L226 Difference]: Without dead ends: 1590 [2019-12-27 16:58:55,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:58:55,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2019-12-27 16:58:55,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1480. [2019-12-27 16:58:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2019-12-27 16:58:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 3877 transitions. [2019-12-27 16:58:55,610 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 3877 transitions. Word has length 32 [2019-12-27 16:58:55,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:55,610 INFO L462 AbstractCegarLoop]: Abstraction has 1480 states and 3877 transitions. [2019-12-27 16:58:55,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:58:55,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 3877 transitions. [2019-12-27 16:58:55,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 16:58:55,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:55,614 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:55,614 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:55,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:55,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1467210822, now seen corresponding path program 1 times [2019-12-27 16:58:55,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:55,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298667617] [2019-12-27 16:58:55,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:55,675 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 16:58:55,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298667617] [2019-12-27 16:58:55,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:55,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:58:55,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [894174766] [2019-12-27 16:58:55,677 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:55,689 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:55,741 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 135 transitions. [2019-12-27 16:58:55,742 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:55,753 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:58:55,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:58:55,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:55,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:58:55,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:58:55,755 INFO L87 Difference]: Start difference. First operand 1480 states and 3877 transitions. Second operand 4 states. [2019-12-27 16:58:55,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:55,781 INFO L93 Difference]: Finished difference Result 2211 states and 5434 transitions. [2019-12-27 16:58:55,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:58:55,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-27 16:58:55,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:55,783 INFO L225 Difference]: With dead ends: 2211 [2019-12-27 16:58:55,783 INFO L226 Difference]: Without dead ends: 775 [2019-12-27 16:58:55,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:58:55,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-12-27 16:58:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2019-12-27 16:58:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-12-27 16:58:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1640 transitions. [2019-12-27 16:58:55,795 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1640 transitions. Word has length 47 [2019-12-27 16:58:55,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:55,795 INFO L462 AbstractCegarLoop]: Abstraction has 775 states and 1640 transitions. [2019-12-27 16:58:55,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:58:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1640 transitions. [2019-12-27 16:58:55,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 16:58:55,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:55,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:55,797 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:55,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:55,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1384248998, now seen corresponding path program 2 times [2019-12-27 16:58:55,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:55,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311377785] [2019-12-27 16:58:55,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:55,895 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 16:58:55,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311377785] [2019-12-27 16:58:55,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:55,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:58:55,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [217993322] [2019-12-27 16:58:55,897 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:55,910 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:56,001 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 211 transitions. [2019-12-27 16:58:56,001 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:56,034 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:58:56,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:58:56,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:56,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:58:56,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:58:56,035 INFO L87 Difference]: Start difference. First operand 775 states and 1640 transitions. Second operand 7 states. [2019-12-27 16:58:56,350 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-12-27 16:58:56,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:56,420 INFO L93 Difference]: Finished difference Result 1953 states and 4058 transitions. [2019-12-27 16:58:56,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 16:58:56,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-27 16:58:56,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:56,424 INFO L225 Difference]: With dead ends: 1953 [2019-12-27 16:58:56,424 INFO L226 Difference]: Without dead ends: 1317 [2019-12-27 16:58:56,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:58:56,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2019-12-27 16:58:56,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 878. [2019-12-27 16:58:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2019-12-27 16:58:56,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1848 transitions. [2019-12-27 16:58:56,439 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1848 transitions. Word has length 47 [2019-12-27 16:58:56,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:56,440 INFO L462 AbstractCegarLoop]: Abstraction has 878 states and 1848 transitions. [2019-12-27 16:58:56,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:58:56,440 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1848 transitions. [2019-12-27 16:58:56,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 16:58:56,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:56,443 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:56,443 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:56,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:56,443 INFO L82 PathProgramCache]: Analyzing trace with hash -801480632, now seen corresponding path program 3 times [2019-12-27 16:58:56,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:56,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146851948] [2019-12-27 16:58:56,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:56,536 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 16:58:56,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146851948] [2019-12-27 16:58:56,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:56,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:58:56,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [156423875] [2019-12-27 16:58:56,537 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:56,549 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:56,647 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 267 transitions. [2019-12-27 16:58:56,647 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:56,693 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:58:56,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:58:56,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:56,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:58:56,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:58:56,694 INFO L87 Difference]: Start difference. First operand 878 states and 1848 transitions. Second operand 6 states. [2019-12-27 16:58:56,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:56,731 INFO L93 Difference]: Finished difference Result 1419 states and 2990 transitions. [2019-12-27 16:58:56,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:58:56,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-27 16:58:56,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:56,732 INFO L225 Difference]: With dead ends: 1419 [2019-12-27 16:58:56,733 INFO L226 Difference]: Without dead ends: 573 [2019-12-27 16:58:56,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:58:56,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-12-27 16:58:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2019-12-27 16:58:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-12-27 16:58:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1194 transitions. [2019-12-27 16:58:56,740 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1194 transitions. Word has length 47 [2019-12-27 16:58:56,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:56,740 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 1194 transitions. [2019-12-27 16:58:56,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:58:56,741 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1194 transitions. [2019-12-27 16:58:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 16:58:56,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:56,742 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:56,742 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:56,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:56,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1009662868, now seen corresponding path program 4 times [2019-12-27 16:58:56,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:56,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210509431] [2019-12-27 16:58:56,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:58:56,947 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 16:58:56,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210509431] [2019-12-27 16:58:56,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:58:56,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:58:56,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1072803179] [2019-12-27 16:58:56,949 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:58:56,961 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:58:57,242 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 217 states and 369 transitions. [2019-12-27 16:58:57,243 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:58:57,382 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 16:58:57,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:58:57,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:58:57,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:58:57,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:58:57,384 INFO L87 Difference]: Start difference. First operand 573 states and 1194 transitions. Second operand 14 states. [2019-12-27 16:58:59,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:58:59,815 INFO L93 Difference]: Finished difference Result 1345 states and 2549 transitions. [2019-12-27 16:58:59,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 16:58:59,816 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-12-27 16:58:59,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:58:59,818 INFO L225 Difference]: With dead ends: 1345 [2019-12-27 16:58:59,818 INFO L226 Difference]: Without dead ends: 1321 [2019-12-27 16:58:59,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=336, Invalid=1146, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 16:58:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-12-27 16:58:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 656. [2019-12-27 16:58:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-12-27 16:58:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1285 transitions. [2019-12-27 16:58:59,834 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1285 transitions. Word has length 47 [2019-12-27 16:58:59,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:58:59,835 INFO L462 AbstractCegarLoop]: Abstraction has 656 states and 1285 transitions. [2019-12-27 16:58:59,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:58:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1285 transitions. [2019-12-27 16:58:59,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 16:58:59,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:58:59,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:58:59,837 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:58:59,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:58:59,837 INFO L82 PathProgramCache]: Analyzing trace with hash 610940604, now seen corresponding path program 5 times [2019-12-27 16:58:59,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:58:59,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781040474] [2019-12-27 16:58:59,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:58:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:59:00,003 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 16:59:00,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781040474] [2019-12-27 16:59:00,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:59:00,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:59:00,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1327907521] [2019-12-27 16:59:00,004 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:59:00,016 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:59:00,271 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 270 transitions. [2019-12-27 16:59:00,272 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:59:00,295 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:59:00,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:59:00,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:59:00,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:59:00,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:59:00,296 INFO L87 Difference]: Start difference. First operand 656 states and 1285 transitions. Second operand 7 states. [2019-12-27 16:59:01,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:59:01,071 INFO L93 Difference]: Finished difference Result 1151 states and 2231 transitions. [2019-12-27 16:59:01,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:59:01,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-27 16:59:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:59:01,075 INFO L225 Difference]: With dead ends: 1151 [2019-12-27 16:59:01,075 INFO L226 Difference]: Without dead ends: 1151 [2019-12-27 16:59:01,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:59:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-12-27 16:59:01,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 686. [2019-12-27 16:59:01,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-12-27 16:59:01,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1353 transitions. [2019-12-27 16:59:01,087 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1353 transitions. Word has length 47 [2019-12-27 16:59:01,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:59:01,088 INFO L462 AbstractCegarLoop]: Abstraction has 686 states and 1353 transitions. [2019-12-27 16:59:01,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:59:01,088 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1353 transitions. [2019-12-27 16:59:01,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 16:59:01,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:59:01,089 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:59:01,090 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:59:01,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:59:01,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1819205216, now seen corresponding path program 6 times [2019-12-27 16:59:01,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:59:01,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192779049] [2019-12-27 16:59:01,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:59:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:59:01,156 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 16:59:01,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192779049] [2019-12-27 16:59:01,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:59:01,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:59:01,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [541476140] [2019-12-27 16:59:01,157 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:59:01,183 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:59:01,296 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 330 transitions. [2019-12-27 16:59:01,296 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:59:01,296 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:59:01,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:59:01,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:59:01,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:59:01,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:59:01,297 INFO L87 Difference]: Start difference. First operand 686 states and 1353 transitions. Second operand 3 states. [2019-12-27 16:59:01,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:59:01,307 INFO L93 Difference]: Finished difference Result 684 states and 1348 transitions. [2019-12-27 16:59:01,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:59:01,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-27 16:59:01,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:59:01,309 INFO L225 Difference]: With dead ends: 684 [2019-12-27 16:59:01,309 INFO L226 Difference]: Without dead ends: 684 [2019-12-27 16:59:01,310 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 16:59:01,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-12-27 16:59:01,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 523. [2019-12-27 16:59:01,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-12-27 16:59:01,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 1030 transitions. [2019-12-27 16:59:01,317 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 1030 transitions. Word has length 47 [2019-12-27 16:59:01,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:59:01,317 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 1030 transitions. [2019-12-27 16:59:01,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:59:01,317 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 1030 transitions. [2019-12-27 16:59:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 16:59:01,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:59:01,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:59:01,319 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:59:01,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:59:01,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1502542547, now seen corresponding path program 1 times [2019-12-27 16:59:01,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:59:01,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813457202] [2019-12-27 16:59:01,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:59:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:59:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:59:01,421 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:59:01,422 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:59:01,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_97| 0 0))) (and (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~z$r_buff1_thd2~0_69) (= v_~z$w_buff0~0_326 0) (= 0 v_~z$r_buff1_thd4~0_128) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p3_EBX~0_104) (= v_~b~0_46 0) (= v_~weak$$choice2~0_157 0) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~z$r_buff0_thd3~0_271) (= v_~z$r_buff0_thd0~0_83 0) (= 0 v_~z$flush_delayed~0_78) (= v_~main$tmp_guard1~0_45 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1061~0.base_46| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1061~0.base_46|) |v_ULTIMATE.start_main_~#t1061~0.offset_30| 0)) |v_#memory_int_25|) (= v_~a~0_68 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1061~0.base_46|)) (= v_~z$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~weak$$choice0~0_39) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z~0_172 0) (= 0 v_~z$r_buff0_thd4~0_139) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1061~0.base_46|) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1061~0.base_46| 4)) (= v_~y~0_82 0) (= |v_#valid_95| (store .cse0 |v_ULTIMATE.start_main_~#t1061~0.base_46| 1)) (= v_~z$read_delayed~0_7 0) (= 0 |v_ULTIMATE.start_main_~#t1061~0.offset_30|) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~z$r_buff1_thd3~0_242) (= 0 |v_#NULL.base_7|) (= v_~z$mem_tmp~0_49 0) (= v_~z$w_buff1_used~0_372 0) (= v_~z$r_buff1_thd0~0_144 0) (= v_~z$w_buff0_used~0_607 0) (= v_~x~0_74 0) (= v_~__unbuffered_p3_EAX~0_105 0) (= v_~z$w_buff1~0_201 0) (= v_~__unbuffered_cnt~0_157 0) (= v_~z$r_buff0_thd2~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_69, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1063~0.offset=|v_ULTIMATE.start_main_~#t1063~0.offset_29|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_83, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_105, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~z$mem_tmp~0=v_~z$mem_tmp~0_49, ULTIMATE.start_main_~#t1062~0.base=|v_ULTIMATE.start_main_~#t1062~0.base_45|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_372, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_42|, ~z$flush_delayed~0=v_~z$flush_delayed~0_78, ~weak$$choice0~0=v_~weak$$choice0~0_39, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_~#t1063~0.base=|v_ULTIMATE.start_main_~#t1063~0.base_45|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_271, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~x~0=v_~x~0_74, ULTIMATE.start_main_~#t1064~0.offset=|v_ULTIMATE.start_main_~#t1064~0.offset_19|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_128, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_~#t1061~0.base=|v_ULTIMATE.start_main_~#t1061~0.base_46|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, ULTIMATE.start_main_~#t1064~0.base=|v_ULTIMATE.start_main_~#t1064~0.base_26|, ~y~0=v_~y~0_82, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25, ULTIMATE.start_main_~#t1062~0.offset=|v_ULTIMATE.start_main_~#t1062~0.offset_29|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_607, ~z$w_buff0~0=v_~z$w_buff0~0_326, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_242, ULTIMATE.start_main_~#t1061~0.offset=|v_ULTIMATE.start_main_~#t1061~0.offset_30|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_128|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_104, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_94|, ~b~0=v_~b~0_46, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_172, ~weak$$choice2~0=v_~weak$$choice2~0_157, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1063~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1062~0.base, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1063~0.base, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1064~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1061~0.base, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1064~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1062~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1061~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:59:01,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L841-1-->L843: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1062~0.base_13| 4) |v_#length_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1062~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t1062~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1062~0.base_13| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1062~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1062~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1062~0.base_13|) |v_ULTIMATE.start_main_~#t1062~0.offset_11| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1062~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1062~0.base=|v_ULTIMATE.start_main_~#t1062~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1062~0.offset=|v_ULTIMATE.start_main_~#t1062~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1062~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1062~0.offset] because there is no mapped edge [2019-12-27 16:59:01,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1063~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1063~0.base_13|) |v_ULTIMATE.start_main_~#t1063~0.offset_11| 2)) |v_#memory_int_19|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1063~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1063~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1063~0.base_13| 4)) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1063~0.base_13| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1063~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1063~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1063~0.base=|v_ULTIMATE.start_main_~#t1063~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1063~0.offset=|v_ULTIMATE.start_main_~#t1063~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1063~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1063~0.offset] because there is no mapped edge [2019-12-27 16:59:01,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L845-1-->L847: Formula: (and (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1064~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1064~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1064~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1064~0.base_11|) |v_ULTIMATE.start_main_~#t1064~0.offset_10| 3)) |v_#memory_int_17|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1064~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1064~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1064~0.offset_10|) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1064~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1064~0.base=|v_ULTIMATE.start_main_~#t1064~0.base_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1064~0.offset=|v_ULTIMATE.start_main_~#t1064~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1064~0.base, #length, ULTIMATE.start_main_~#t1064~0.offset] because there is no mapped edge [2019-12-27 16:59:01,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_10| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_12) (= v_~z$w_buff0~0_26 v_~z$w_buff1~0_20) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_10| 1) (= 1 v_~z$w_buff0~0_25) (= v_~z$w_buff0_used~0_113 v_~z$w_buff1_used~0_69) (= v_~z$w_buff0_used~0_112 1) (= v_P3Thread1of1ForFork1_~arg.base_10 |v_P3Thread1of1ForFork1_#in~arg.base_10|) (= (mod v_~z$w_buff1_used~0_69 256) 0) (= v_P3Thread1of1ForFork1_~arg.offset_10 |v_P3Thread1of1ForFork1_#in~arg.offset_10|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_26, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_25, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|, ~z$w_buff1~0=v_~z$w_buff1~0_20, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_10, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_10} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 16:59:01,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_~b~0_24 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_18| v_P0Thread1of1ForFork2_~arg.offset_18) (= v_~x~0_35 1) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= v_P0Thread1of1ForFork2_~arg.base_18 |v_P0Thread1of1ForFork2_#in~arg.base_18|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~b~0=v_~b~0_24, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_18, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_35, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_18} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 16:59:01,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= |v_P1Thread1of1ForFork3_#in~arg.base_14| v_P1Thread1of1ForFork3_~arg.base_14) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= v_~x~0_48 2) (= |v_P1Thread1of1ForFork3_#in~arg.offset_14| v_P1Thread1of1ForFork3_~arg.offset_14) (= v_~__unbuffered_cnt~0_131 (+ v_~__unbuffered_cnt~0_132 1)) (= v_~y~0_47 1)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_14, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_14, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|, ~y~0=v_~y~0_47, ~x~0=v_~x~0_48} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-27 16:59:01,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L776-->L776-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-131840910 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-131840910 256)))) (or (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-131840910 256) 0)) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-131840910 256))) (= (mod ~z$w_buff0_used~0_In-131840910 256) 0))) (= ~z$w_buff0~0_In-131840910 |P2Thread1of1ForFork0_#t~ite8_Out-131840910|) (= |P2Thread1of1ForFork0_#t~ite9_Out-131840910| |P2Thread1of1ForFork0_#t~ite8_Out-131840910|) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite8_In-131840910| |P2Thread1of1ForFork0_#t~ite8_Out-131840910|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite9_Out-131840910| ~z$w_buff0~0_In-131840910)))) InVars {P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_In-131840910|, ~z$w_buff0~0=~z$w_buff0~0_In-131840910, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-131840910, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-131840910, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-131840910, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-131840910, ~weak$$choice2~0=~weak$$choice2~0_In-131840910} OutVars{P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_Out-131840910|, ~z$w_buff0~0=~z$w_buff0~0_In-131840910, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-131840910, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-131840910, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-131840910, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-131840910, ~weak$$choice2~0=~weak$$choice2~0_In-131840910, P2Thread1of1ForFork0_#t~ite9=|P2Thread1of1ForFork0_#t~ite9_Out-131840910|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite8, P2Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 16:59:01,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L777-->L777-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1437324607 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite11_In-1437324607| |P2Thread1of1ForFork0_#t~ite11_Out-1437324607|) (= ~z$w_buff1~0_In-1437324607 |P2Thread1of1ForFork0_#t~ite12_Out-1437324607|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1437324607 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-1437324607 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In-1437324607 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-1437324607 256)))) .cse0 (= ~z$w_buff1~0_In-1437324607 |P2Thread1of1ForFork0_#t~ite11_Out-1437324607|) (= |P2Thread1of1ForFork0_#t~ite12_Out-1437324607| |P2Thread1of1ForFork0_#t~ite11_Out-1437324607|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1437324607, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In-1437324607|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1437324607, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1437324607, ~z$w_buff1~0=~z$w_buff1~0_In-1437324607, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1437324607, ~weak$$choice2~0=~weak$$choice2~0_In-1437324607} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-1437324607|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1437324607, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-1437324607|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1437324607, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1437324607, ~z$w_buff1~0=~z$w_buff1~0_In-1437324607, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1437324607, ~weak$$choice2~0=~weak$$choice2~0_In-1437324607} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 16:59:01,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L778-->L778-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In2141836608 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite14_Out2141836608| |P2Thread1of1ForFork0_#t~ite15_Out2141836608|) (= |P2Thread1of1ForFork0_#t~ite14_Out2141836608| ~z$w_buff0_used~0_In2141836608) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In2141836608 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In2141836608 256) 0) .cse0) (= 0 (mod ~z$w_buff0_used~0_In2141836608 256)) (and (= (mod ~z$w_buff1_used~0_In2141836608 256) 0) .cse0))) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite14_In2141836608| |P2Thread1of1ForFork0_#t~ite14_Out2141836608|) (= ~z$w_buff0_used~0_In2141836608 |P2Thread1of1ForFork0_#t~ite15_Out2141836608|)))) InVars {P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_In2141836608|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2141836608, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2141836608, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2141836608, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2141836608, ~weak$$choice2~0=~weak$$choice2~0_In2141836608} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out2141836608|, P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out2141836608|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2141836608, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2141836608, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2141836608, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2141836608, ~weak$$choice2~0=~weak$$choice2~0_In2141836608} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-12-27 16:59:01,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L780-->L781: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~z$r_buff0_thd3~0_73 v_~z$r_buff0_thd3~0_72)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_72, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_11|, ~weak$$choice2~0=v_~weak$$choice2~0_32, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 16:59:01,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1405746107 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1405746107 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1405746107 |P3Thread1of1ForFork1_#t~ite28_Out-1405746107|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P3Thread1of1ForFork1_#t~ite28_Out-1405746107|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1405746107, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1405746107} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1405746107, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out-1405746107|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1405746107} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 16:59:01,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L783-->L791: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 16:59:01,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L820-->L820-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd4~0_In-585250855 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-585250855 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-585250855 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-585250855 256)))) (or (and (= 0 |P3Thread1of1ForFork1_#t~ite29_Out-585250855|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-585250855 |P3Thread1of1ForFork1_#t~ite29_Out-585250855|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-585250855, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-585250855, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-585250855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-585250855} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-585250855, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out-585250855|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-585250855, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-585250855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-585250855} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 16:59:01,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L821-->L822: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1654141439 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1654141439 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-1654141439 ~z$r_buff0_thd4~0_In-1654141439)) (and (not .cse1) (= ~z$r_buff0_thd4~0_Out-1654141439 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1654141439, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1654141439} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1654141439, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1654141439, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-1654141439|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 16:59:01,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1955731239 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1955731239 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In1955731239 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1955731239 256) 0))) (or (and (= 0 |P3Thread1of1ForFork1_#t~ite31_Out1955731239|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd4~0_In1955731239 |P3Thread1of1ForFork1_#t~ite31_Out1955731239|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1955731239, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1955731239, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1955731239, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1955731239} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1955731239, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1955731239, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1955731239, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1955731239, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out1955731239|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 16:59:01,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L822-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= v_~z$r_buff1_thd4~0_56 |v_P3Thread1of1ForFork1_#t~ite31_60|) (= |v_P3Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_60|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_56, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_59|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 16:59:01,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L847-1-->L853: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 4 v_~__unbuffered_cnt~0_60)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:59:01,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L853-2-->L853-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In640946529 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In640946529 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In640946529 |ULTIMATE.start_main_#t~ite36_Out640946529|) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In640946529 |ULTIMATE.start_main_#t~ite36_Out640946529|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In640946529, ~z$w_buff1_used~0=~z$w_buff1_used~0_In640946529, ~z$w_buff1~0=~z$w_buff1~0_In640946529, ~z~0=~z~0_In640946529} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In640946529, ~z$w_buff1_used~0=~z$w_buff1_used~0_In640946529, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out640946529|, ~z$w_buff1~0=~z$w_buff1~0_In640946529, ~z~0=~z~0_In640946529} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 16:59:01,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L853-4-->L854: Formula: (= v_~z~0_38 |v_ULTIMATE.start_main_#t~ite36_16|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_16|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-27 16:59:01,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L854-->L854-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1162149510 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1162149510 256)))) (or (and (= ~z$w_buff0_used~0_In-1162149510 |ULTIMATE.start_main_#t~ite38_Out-1162149510|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out-1162149510| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1162149510, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1162149510} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1162149510, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1162149510, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1162149510|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 16:59:01,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In467338150 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In467338150 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In467338150 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In467338150 256) 0))) (or (and (= ~z$w_buff1_used~0_In467338150 |ULTIMATE.start_main_#t~ite39_Out467338150|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite39_Out467338150| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In467338150, ~z$w_buff0_used~0=~z$w_buff0_used~0_In467338150, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In467338150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In467338150} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In467338150, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out467338150|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In467338150, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In467338150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In467338150} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 16:59:01,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1355077651 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1355077651 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite40_Out1355077651|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In1355077651 |ULTIMATE.start_main_#t~ite40_Out1355077651|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1355077651, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1355077651} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1355077651, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1355077651|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1355077651} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 16:59:01,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L857-->L857-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-517520948 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-517520948 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-517520948 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-517520948 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite41_Out-517520948| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In-517520948 |ULTIMATE.start_main_#t~ite41_Out-517520948|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-517520948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-517520948, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-517520948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-517520948} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-517520948|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-517520948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-517520948, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-517520948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-517520948} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 16:59:01,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p3_EAX~0_73) (= 0 v_~__unbuffered_p3_EBX~0_72) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~z$r_buff1_thd0~0_110 |v_ULTIMATE.start_main_#t~ite41_51|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~x~0_52 2) (= v_~main$tmp_guard1~0_23 0) (= v_~y~0_52 2)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_51|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_50|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_110, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:59:01,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:59:01 BasicIcfg [2019-12-27 16:59:01,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:59:01,564 INFO L168 Benchmark]: Toolchain (without parser) took 24919.31 ms. Allocated memory was 147.3 MB in the beginning and 1.1 GB in the end (delta: 931.1 MB). Free memory was 103.6 MB in the beginning and 298.7 MB in the end (delta: -195.1 MB). Peak memory consumption was 736.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:59:01,565 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 16:59:01,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 890.55 ms. Allocated memory was 147.3 MB in the beginning and 207.6 MB in the end (delta: 60.3 MB). Free memory was 103.4 MB in the beginning and 160.1 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:59:01,566 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.99 ms. Allocated memory is still 207.6 MB. Free memory was 160.1 MB in the beginning and 156.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:59:01,567 INFO L168 Benchmark]: Boogie Preprocessor took 41.87 ms. Allocated memory is still 207.6 MB. Free memory was 156.8 MB in the beginning and 154.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:59:01,568 INFO L168 Benchmark]: RCFGBuilder took 820.24 ms. Allocated memory is still 207.6 MB. Free memory was 154.8 MB in the beginning and 108.6 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-27 16:59:01,568 INFO L168 Benchmark]: TraceAbstraction took 23074.92 ms. Allocated memory was 207.6 MB in the beginning and 1.1 GB in the end (delta: 870.8 MB). Free memory was 107.9 MB in the beginning and 298.7 MB in the end (delta: -190.8 MB). Peak memory consumption was 680.1 MB. Max. memory is 7.1 GB. [2019-12-27 16:59:01,572 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.19 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 890.55 ms. Allocated memory was 147.3 MB in the beginning and 207.6 MB in the end (delta: 60.3 MB). Free memory was 103.4 MB in the beginning and 160.1 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.99 ms. Allocated memory is still 207.6 MB. Free memory was 160.1 MB in the beginning and 156.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.87 ms. Allocated memory is still 207.6 MB. Free memory was 156.8 MB in the beginning and 154.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 820.24 ms. Allocated memory is still 207.6 MB. Free memory was 154.8 MB in the beginning and 108.6 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23074.92 ms. Allocated memory was 207.6 MB in the beginning and 1.1 GB in the end (delta: 870.8 MB). Free memory was 107.9 MB in the beginning and 298.7 MB in the end (delta: -190.8 MB). Peak memory consumption was 680.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 169 ProgramPointsBefore, 79 ProgramPointsAfterwards, 191 TransitionsBefore, 83 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 23 ChoiceCompositions, 5572 VarBasedMoverChecksPositive, 186 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 165 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 46301 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t1061, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t1062, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1063, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1064, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 [L809] 4 a = 1 [L812] 4 __unbuffered_p3_EAX = a [L815] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L819] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L820] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L853] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L856] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 22.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1786 SDtfs, 2454 SDslu, 3726 SDs, 0 SdLazy, 1974 SolverSat, 223 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 71 SyntacticMatches, 9 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27254occurred 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: 5.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 4138 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 533 NumberOfCodeBlocks, 533 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 470 ConstructedInterpolants, 0 QuantifiedInterpolants, 57501 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...