/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:11:21,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:11:21,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:11:21,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:11:21,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:11:21,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:11:21,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:11:21,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:11:21,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:11:21,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:11:21,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:11:21,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:11:21,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:11:21,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:11:21,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:11:21,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:11:21,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:11:21,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:11:21,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:11:21,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:11:21,691 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:11:21,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:11:21,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:11:21,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:11:21,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:11:21,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:11:21,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:11:21,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:11:21,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:11:21,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:11:21,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:11:21,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:11:21,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:11:21,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:11:21,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:11:21,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:11:21,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:11:21,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:11:21,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:11:21,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:11:21,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:11:21,713 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:11:21,745 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:11:21,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:11:21,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:11:21,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:11:21,750 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:11:21,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:11:21,750 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:11:21,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:11:21,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:11:21,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:11:21,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:11:21,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:11:21,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:11:21,752 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:11:21,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:11:21,752 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:11:21,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:11:21,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:11:21,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:11:21,754 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:11:21,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:11:21,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:11:21,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:11:21,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:11:21,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:11:21,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:11:21,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:11:21,759 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:11:21,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:11:21,760 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:11:22,032 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:11:22,052 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:11:22,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:11:22,058 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:11:22,058 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:11:22,059 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_tso.opt.i [2019-12-18 21:11:22,125 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2cc957ad/64193467cdeb483b9eeac3a411afff04/FLAGd6ee7dab1 [2019-12-18 21:11:22,652 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:11:22,653 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_tso.opt.i [2019-12-18 21:11:22,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2cc957ad/64193467cdeb483b9eeac3a411afff04/FLAGd6ee7dab1 [2019-12-18 21:11:22,998 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2cc957ad/64193467cdeb483b9eeac3a411afff04 [2019-12-18 21:11:23,009 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:11:23,011 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:11:23,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:11:23,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:11:23,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:11:23,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:11:22" (1/1) ... [2019-12-18 21:11:23,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:23, skipping insertion in model container [2019-12-18 21:11:23,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:11:22" (1/1) ... [2019-12-18 21:11:23,025 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:11:23,083 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:11:23,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:11:23,649 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:11:23,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:11:23,793 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:11:23,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:23 WrapperNode [2019-12-18 21:11:23,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:11:23,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:11:23,795 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:11:23,795 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:11:23,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:23" (1/1) ... [2019-12-18 21:11:23,823 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:23" (1/1) ... [2019-12-18 21:11:23,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:11:23,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:11:23,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:11:23,859 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:11:23,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:23" (1/1) ... [2019-12-18 21:11:23,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:23" (1/1) ... [2019-12-18 21:11:23,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:23" (1/1) ... [2019-12-18 21:11:23,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:23" (1/1) ... [2019-12-18 21:11:23,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:23" (1/1) ... [2019-12-18 21:11:23,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:23" (1/1) ... [2019-12-18 21:11:23,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:23" (1/1) ... [2019-12-18 21:11:23,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:11:23,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:11:23,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:11:23,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:11:23,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:11:23,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:11:23,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:11:23,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:11:23,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:11:23,965 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:11:23,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:11:23,965 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:11:23,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:11:23,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:11:23,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:11:23,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:11:23,967 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:11:24,655 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:11:24,655 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:11:24,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:11:24 BoogieIcfgContainer [2019-12-18 21:11:24,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:11:24,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:11:24,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:11:24,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:11:24,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:11:22" (1/3) ... [2019-12-18 21:11:24,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ce94b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:11:24, skipping insertion in model container [2019-12-18 21:11:24,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:23" (2/3) ... [2019-12-18 21:11:24,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ce94b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:11:24, skipping insertion in model container [2019-12-18 21:11:24,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:11:24" (3/3) ... [2019-12-18 21:11:24,667 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_tso.opt.i [2019-12-18 21:11:24,677 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:11:24,678 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:11:24,686 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:11:24,687 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:11:24,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,726 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,727 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,752 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,752 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,753 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,753 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,753 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,764 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,765 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,765 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,771 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,788 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:24,810 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:11:24,832 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:11:24,833 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:11:24,833 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:11:24,833 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:11:24,835 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:11:24,835 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:11:24,835 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:11:24,836 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:11:24,860 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-18 21:11:24,862 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 21:11:24,931 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 21:11:24,931 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:11:24,944 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 21:11:24,961 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 21:11:24,997 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 21:11:24,998 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:11:25,004 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 21:11:25,017 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-18 21:11:25,018 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:11:28,122 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 21:11:28,242 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 21:11:28,355 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47140 [2019-12-18 21:11:28,355 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-18 21:11:28,359 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68 places, 81 transitions [2019-12-18 21:11:28,747 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 7039 states. [2019-12-18 21:11:28,749 INFO L276 IsEmpty]: Start isEmpty. Operand 7039 states. [2019-12-18 21:11:28,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 21:11:28,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:28,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 21:11:28,757 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:28,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:28,763 INFO L82 PathProgramCache]: Analyzing trace with hash 676937921, now seen corresponding path program 1 times [2019-12-18 21:11:28,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:28,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191523906] [2019-12-18 21:11:28,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:29,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:11:29,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191523906] [2019-12-18 21:11:29,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:29,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:11:29,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618672614] [2019-12-18 21:11:29,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:29,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:29,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:29,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:29,038 INFO L87 Difference]: Start difference. First operand 7039 states. Second operand 3 states. [2019-12-18 21:11:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:29,256 INFO L93 Difference]: Finished difference Result 6767 states and 23009 transitions. [2019-12-18 21:11:29,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:29,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 21:11:29,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:29,330 INFO L225 Difference]: With dead ends: 6767 [2019-12-18 21:11:29,330 INFO L226 Difference]: Without dead ends: 6364 [2019-12-18 21:11:29,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:29,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6364 states. [2019-12-18 21:11:29,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6364 to 6364. [2019-12-18 21:11:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6364 states. [2019-12-18 21:11:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6364 states to 6364 states and 21600 transitions. [2019-12-18 21:11:29,741 INFO L78 Accepts]: Start accepts. Automaton has 6364 states and 21600 transitions. Word has length 5 [2019-12-18 21:11:29,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:29,741 INFO L462 AbstractCegarLoop]: Abstraction has 6364 states and 21600 transitions. [2019-12-18 21:11:29,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:29,742 INFO L276 IsEmpty]: Start isEmpty. Operand 6364 states and 21600 transitions. [2019-12-18 21:11:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:11:29,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:29,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:29,747 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:29,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:29,748 INFO L82 PathProgramCache]: Analyzing trace with hash 616679643, now seen corresponding path program 1 times [2019-12-18 21:11:29,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:29,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125527722] [2019-12-18 21:11:29,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:11:29,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125527722] [2019-12-18 21:11:29,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:29,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:11:29,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715039214] [2019-12-18 21:11:29,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:29,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:29,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:29,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:29,843 INFO L87 Difference]: Start difference. First operand 6364 states and 21600 transitions. Second operand 3 states. [2019-12-18 21:11:29,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:29,879 INFO L93 Difference]: Finished difference Result 1256 states and 3141 transitions. [2019-12-18 21:11:29,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:29,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 21:11:29,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:29,887 INFO L225 Difference]: With dead ends: 1256 [2019-12-18 21:11:29,887 INFO L226 Difference]: Without dead ends: 1256 [2019-12-18 21:11:29,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:29,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-12-18 21:11:29,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1256. [2019-12-18 21:11:29,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-12-18 21:11:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 3141 transitions. [2019-12-18 21:11:29,919 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 3141 transitions. Word has length 11 [2019-12-18 21:11:29,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:29,920 INFO L462 AbstractCegarLoop]: Abstraction has 1256 states and 3141 transitions. [2019-12-18 21:11:29,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:29,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 3141 transitions. [2019-12-18 21:11:29,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:11:29,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:29,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:29,926 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:29,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:29,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1879138245, now seen corresponding path program 1 times [2019-12-18 21:11:29,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:29,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689746003] [2019-12-18 21:11:29,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:11:30,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689746003] [2019-12-18 21:11:30,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:30,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:11:30,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534301070] [2019-12-18 21:11:30,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:30,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:30,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:30,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:30,038 INFO L87 Difference]: Start difference. First operand 1256 states and 3141 transitions. Second operand 3 states. [2019-12-18 21:11:30,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:30,124 INFO L93 Difference]: Finished difference Result 1890 states and 4794 transitions. [2019-12-18 21:11:30,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:30,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 21:11:30,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:30,143 INFO L225 Difference]: With dead ends: 1890 [2019-12-18 21:11:30,144 INFO L226 Difference]: Without dead ends: 1890 [2019-12-18 21:11:30,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:30,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2019-12-18 21:11:30,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1402. [2019-12-18 21:11:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-12-18 21:11:30,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 3578 transitions. [2019-12-18 21:11:30,197 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 3578 transitions. Word has length 14 [2019-12-18 21:11:30,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:30,198 INFO L462 AbstractCegarLoop]: Abstraction has 1402 states and 3578 transitions. [2019-12-18 21:11:30,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:30,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 3578 transitions. [2019-12-18 21:11:30,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:11:30,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:30,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:30,200 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:30,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:30,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1741563407, now seen corresponding path program 1 times [2019-12-18 21:11:30,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:30,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736692530] [2019-12-18 21:11:30,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:30,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:11:30,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736692530] [2019-12-18 21:11:30,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:30,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:11:30,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164513318] [2019-12-18 21:11:30,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:11:30,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:30,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:11:30,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:11:30,312 INFO L87 Difference]: Start difference. First operand 1402 states and 3578 transitions. Second operand 4 states. [2019-12-18 21:11:30,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:30,461 INFO L93 Difference]: Finished difference Result 1822 states and 4488 transitions. [2019-12-18 21:11:30,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:11:30,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:11:30,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:30,473 INFO L225 Difference]: With dead ends: 1822 [2019-12-18 21:11:30,474 INFO L226 Difference]: Without dead ends: 1822 [2019-12-18 21:11:30,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:11:30,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-12-18 21:11:30,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1690. [2019-12-18 21:11:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-12-18 21:11:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 4193 transitions. [2019-12-18 21:11:30,518 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 4193 transitions. Word has length 14 [2019-12-18 21:11:30,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:30,519 INFO L462 AbstractCegarLoop]: Abstraction has 1690 states and 4193 transitions. [2019-12-18 21:11:30,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:11:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 4193 transitions. [2019-12-18 21:11:30,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:11:30,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:30,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:30,520 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:30,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:30,520 INFO L82 PathProgramCache]: Analyzing trace with hash -630956330, now seen corresponding path program 1 times [2019-12-18 21:11:30,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:30,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826676529] [2019-12-18 21:11:30,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:30,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:11:30,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826676529] [2019-12-18 21:11:30,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:30,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:11:30,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238051444] [2019-12-18 21:11:30,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:11:30,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:30,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:11:30,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:11:30,563 INFO L87 Difference]: Start difference. First operand 1690 states and 4193 transitions. Second operand 4 states. [2019-12-18 21:11:30,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:30,766 INFO L93 Difference]: Finished difference Result 2106 states and 5110 transitions. [2019-12-18 21:11:30,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:11:30,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:11:30,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:30,781 INFO L225 Difference]: With dead ends: 2106 [2019-12-18 21:11:30,782 INFO L226 Difference]: Without dead ends: 2106 [2019-12-18 21:11:30,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:11:30,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2019-12-18 21:11:30,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 1722. [2019-12-18 21:11:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2019-12-18 21:11:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 4268 transitions. [2019-12-18 21:11:30,828 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 4268 transitions. Word has length 14 [2019-12-18 21:11:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:30,829 INFO L462 AbstractCegarLoop]: Abstraction has 1722 states and 4268 transitions. [2019-12-18 21:11:30,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:11:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 4268 transitions. [2019-12-18 21:11:30,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:11:30,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:30,832 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:30,832 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:30,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:30,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1908220347, now seen corresponding path program 1 times [2019-12-18 21:11:30,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:30,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580176738] [2019-12-18 21:11:30,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:11:31,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580176738] [2019-12-18 21:11:31,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:31,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:11:31,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478247553] [2019-12-18 21:11:31,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:11:31,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:31,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:11:31,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:11:31,014 INFO L87 Difference]: Start difference. First operand 1722 states and 4268 transitions. Second operand 5 states. [2019-12-18 21:11:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:31,432 INFO L93 Difference]: Finished difference Result 2539 states and 6152 transitions. [2019-12-18 21:11:31,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:11:31,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 21:11:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:31,448 INFO L225 Difference]: With dead ends: 2539 [2019-12-18 21:11:31,449 INFO L226 Difference]: Without dead ends: 2539 [2019-12-18 21:11:31,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:11:31,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2019-12-18 21:11:31,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2088. [2019-12-18 21:11:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2019-12-18 21:11:31,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 5108 transitions. [2019-12-18 21:11:31,504 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 5108 transitions. Word has length 26 [2019-12-18 21:11:31,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:31,505 INFO L462 AbstractCegarLoop]: Abstraction has 2088 states and 5108 transitions. [2019-12-18 21:11:31,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:11:31,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 5108 transitions. [2019-12-18 21:11:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:11:31,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:31,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:31,509 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:31,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:31,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1539399223, now seen corresponding path program 1 times [2019-12-18 21:11:31,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:31,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700434828] [2019-12-18 21:11:31,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:11:31,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700434828] [2019-12-18 21:11:31,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:31,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:11:31,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440564622] [2019-12-18 21:11:31,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:31,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:31,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:31,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:31,545 INFO L87 Difference]: Start difference. First operand 2088 states and 5108 transitions. Second operand 3 states. [2019-12-18 21:11:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:31,589 INFO L93 Difference]: Finished difference Result 2656 states and 6125 transitions. [2019-12-18 21:11:31,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:31,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 21:11:31,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:31,598 INFO L225 Difference]: With dead ends: 2656 [2019-12-18 21:11:31,598 INFO L226 Difference]: Without dead ends: 2656 [2019-12-18 21:11:31,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:31,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2019-12-18 21:11:31,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2012. [2019-12-18 21:11:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-12-18 21:11:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 4566 transitions. [2019-12-18 21:11:31,646 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 4566 transitions. Word has length 26 [2019-12-18 21:11:31,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:31,646 INFO L462 AbstractCegarLoop]: Abstraction has 2012 states and 4566 transitions. [2019-12-18 21:11:31,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:31,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 4566 transitions. [2019-12-18 21:11:31,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:11:31,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:31,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:31,650 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:31,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:31,650 INFO L82 PathProgramCache]: Analyzing trace with hash 515096143, now seen corresponding path program 1 times [2019-12-18 21:11:31,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:31,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487904065] [2019-12-18 21:11:31,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:11:31,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487904065] [2019-12-18 21:11:31,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:31,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:11:31,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361743822] [2019-12-18 21:11:31,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:11:31,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:31,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:11:31,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:11:31,693 INFO L87 Difference]: Start difference. First operand 2012 states and 4566 transitions. Second operand 4 states. [2019-12-18 21:11:31,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:31,711 INFO L93 Difference]: Finished difference Result 1020 states and 2119 transitions. [2019-12-18 21:11:31,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:11:31,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-18 21:11:31,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:31,715 INFO L225 Difference]: With dead ends: 1020 [2019-12-18 21:11:31,715 INFO L226 Difference]: Without dead ends: 1020 [2019-12-18 21:11:31,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:11:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2019-12-18 21:11:31,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 916. [2019-12-18 21:11:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-12-18 21:11:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1920 transitions. [2019-12-18 21:11:31,736 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1920 transitions. Word has length 26 [2019-12-18 21:11:31,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:31,737 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1920 transitions. [2019-12-18 21:11:31,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:11:31,737 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1920 transitions. [2019-12-18 21:11:31,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 21:11:31,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:31,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:31,741 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:31,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:31,741 INFO L82 PathProgramCache]: Analyzing trace with hash 121485183, now seen corresponding path program 1 times [2019-12-18 21:11:31,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:31,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555323219] [2019-12-18 21:11:31,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:31,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:11:31,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555323219] [2019-12-18 21:11:31,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:31,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:11:31,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638609419] [2019-12-18 21:11:31,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:11:31,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:31,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:11:31,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:11:31,832 INFO L87 Difference]: Start difference. First operand 916 states and 1920 transitions. Second operand 7 states. [2019-12-18 21:11:32,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:32,178 INFO L93 Difference]: Finished difference Result 2427 states and 4936 transitions. [2019-12-18 21:11:32,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:11:32,179 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-18 21:11:32,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:32,186 INFO L225 Difference]: With dead ends: 2427 [2019-12-18 21:11:32,187 INFO L226 Difference]: Without dead ends: 1586 [2019-12-18 21:11:32,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:11:32,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2019-12-18 21:11:32,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 999. [2019-12-18 21:11:32,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2019-12-18 21:11:32,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 2081 transitions. [2019-12-18 21:11:32,216 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 2081 transitions. Word has length 41 [2019-12-18 21:11:32,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:32,221 INFO L462 AbstractCegarLoop]: Abstraction has 999 states and 2081 transitions. [2019-12-18 21:11:32,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:11:32,222 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 2081 transitions. [2019-12-18 21:11:32,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 21:11:32,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:32,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:32,225 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:32,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:32,225 INFO L82 PathProgramCache]: Analyzing trace with hash 946311763, now seen corresponding path program 2 times [2019-12-18 21:11:32,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:32,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778047500] [2019-12-18 21:11:32,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:32,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:11:32,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778047500] [2019-12-18 21:11:32,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:32,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:11:32,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467760433] [2019-12-18 21:11:32,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:11:32,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:32,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:11:32,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:11:32,292 INFO L87 Difference]: Start difference. First operand 999 states and 2081 transitions. Second operand 4 states. [2019-12-18 21:11:32,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:32,311 INFO L93 Difference]: Finished difference Result 1698 states and 3532 transitions. [2019-12-18 21:11:32,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:11:32,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-18 21:11:32,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:32,313 INFO L225 Difference]: With dead ends: 1698 [2019-12-18 21:11:32,313 INFO L226 Difference]: Without dead ends: 727 [2019-12-18 21:11:32,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:11:32,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-12-18 21:11:32,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-12-18 21:11:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-12-18 21:11:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1499 transitions. [2019-12-18 21:11:32,327 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1499 transitions. Word has length 41 [2019-12-18 21:11:32,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:32,327 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 1499 transitions. [2019-12-18 21:11:32,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:11:32,327 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1499 transitions. [2019-12-18 21:11:32,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 21:11:32,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:32,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:32,330 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:32,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:32,330 INFO L82 PathProgramCache]: Analyzing trace with hash 41544589, now seen corresponding path program 3 times [2019-12-18 21:11:32,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:32,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763826186] [2019-12-18 21:11:32,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:32,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:11:32,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763826186] [2019-12-18 21:11:32,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:32,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:11:32,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309758912] [2019-12-18 21:11:32,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:11:32,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:32,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:11:32,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:11:32,407 INFO L87 Difference]: Start difference. First operand 727 states and 1499 transitions. Second operand 7 states. [2019-12-18 21:11:32,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:32,572 INFO L93 Difference]: Finished difference Result 1196 states and 2405 transitions. [2019-12-18 21:11:32,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:11:32,572 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-18 21:11:32,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:32,574 INFO L225 Difference]: With dead ends: 1196 [2019-12-18 21:11:32,574 INFO L226 Difference]: Without dead ends: 768 [2019-12-18 21:11:32,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:11:32,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2019-12-18 21:11:32,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 715. [2019-12-18 21:11:32,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-12-18 21:11:32,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1473 transitions. [2019-12-18 21:11:32,588 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1473 transitions. Word has length 41 [2019-12-18 21:11:32,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:32,589 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1473 transitions. [2019-12-18 21:11:32,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:11:32,589 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1473 transitions. [2019-12-18 21:11:32,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 21:11:32,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:32,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:32,591 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:32,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:32,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1427821265, now seen corresponding path program 4 times [2019-12-18 21:11:32,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:32,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820632237] [2019-12-18 21:11:32,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:32,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:11:32,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820632237] [2019-12-18 21:11:32,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:32,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:11:32,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050731157] [2019-12-18 21:11:32,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:11:32,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:32,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:11:32,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:11:32,681 INFO L87 Difference]: Start difference. First operand 715 states and 1473 transitions. Second operand 6 states. [2019-12-18 21:11:33,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:33,074 INFO L93 Difference]: Finished difference Result 840 states and 1706 transitions. [2019-12-18 21:11:33,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:11:33,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 21:11:33,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:33,077 INFO L225 Difference]: With dead ends: 840 [2019-12-18 21:11:33,078 INFO L226 Difference]: Without dead ends: 840 [2019-12-18 21:11:33,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:11:33,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-12-18 21:11:33,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 745. [2019-12-18 21:11:33,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-12-18 21:11:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1528 transitions. [2019-12-18 21:11:33,093 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1528 transitions. Word has length 41 [2019-12-18 21:11:33,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:33,093 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1528 transitions. [2019-12-18 21:11:33,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:11:33,093 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1528 transitions. [2019-12-18 21:11:33,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 21:11:33,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:33,096 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:33,096 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:33,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:33,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1918825619, now seen corresponding path program 5 times [2019-12-18 21:11:33,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:33,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320599482] [2019-12-18 21:11:33,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:11:33,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320599482] [2019-12-18 21:11:33,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:33,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:11:33,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484674449] [2019-12-18 21:11:33,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:33,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:33,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:33,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:33,159 INFO L87 Difference]: Start difference. First operand 745 states and 1528 transitions. Second operand 3 states. [2019-12-18 21:11:33,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:33,174 INFO L93 Difference]: Finished difference Result 743 states and 1523 transitions. [2019-12-18 21:11:33,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:33,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 21:11:33,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:33,176 INFO L225 Difference]: With dead ends: 743 [2019-12-18 21:11:33,176 INFO L226 Difference]: Without dead ends: 743 [2019-12-18 21:11:33,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:33,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-12-18 21:11:33,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 607. [2019-12-18 21:11:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-12-18 21:11:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1271 transitions. [2019-12-18 21:11:33,188 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1271 transitions. Word has length 41 [2019-12-18 21:11:33,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:33,189 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 1271 transitions. [2019-12-18 21:11:33,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1271 transitions. [2019-12-18 21:11:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 21:11:33,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:33,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:33,191 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:33,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:33,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1275116415, now seen corresponding path program 1 times [2019-12-18 21:11:33,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:33,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873710927] [2019-12-18 21:11:33,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:11:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:11:33,290 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:11:33,290 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:11:33,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= 0 v_~x$r_buff0_thd2~0_26) (= 0 v_~__unbuffered_p1_EAX~0_11) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~x$w_buff1~0_25) (= |v_#NULL.offset_6| 0) (= 0 v_~x$r_buff0_thd1~0_65) (= v_~x$r_buff1_thd0~0_18 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t911~0.base_25|) (= 0 v_~__unbuffered_cnt~0_17) (= v_~z~0_10 0) (= 0 v_~x$w_buff0_used~0_95) (= (select .cse0 |v_ULTIMATE.start_main_~#t911~0.base_25|) 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_39 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t911~0.base_25| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t911~0.base_25|) |v_ULTIMATE.start_main_~#t911~0.offset_19| 0)) |v_#memory_int_15|) (= 0 v_~x$read_delayed~0_6) (= 0 |v_ULTIMATE.start_main_~#t911~0.offset_19|) (= 0 v_~x$r_buff0_thd0~0_18) (< 0 |v_#StackHeapBarrier_14|) (= v_~x$mem_tmp~0_8 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t911~0.base_25| 1)) (= v_~x$r_buff1_thd2~0_19 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t911~0.base_25| 4)) (= v_~x$flush_delayed~0_12 0) (= v_~main$tmp_guard1~0_14 0) (= v_~x$w_buff1_used~0_55 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~x~0_21 0) (= v_~__unbuffered_p1_EBX~0_11 0) (= 0 v_~x$w_buff0~0_28) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ULTIMATE.start_main_~#t912~0.offset=|v_ULTIMATE.start_main_~#t912~0.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_8, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ULTIMATE.start_main_~#t912~0.base=|v_ULTIMATE.start_main_~#t912~0.base_22|, #length=|v_#length_15|, ~y~0=v_~y~0_9, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_18, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_11, ULTIMATE.start_main_~#t911~0.base=|v_ULTIMATE.start_main_~#t911~0.base_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ~x$w_buff1~0=v_~x$w_buff1~0_25, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_9|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_55, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_9|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_95, ULTIMATE.start_main_~#t911~0.offset=|v_ULTIMATE.start_main_~#t911~0.offset_19|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~z~0=v_~z~0_10, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_21, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t912~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t912~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t911~0.base, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t911~0.offset, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 21:11:33,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t912~0.offset_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t912~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t912~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t912~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t912~0.base_12|) |v_ULTIMATE.start_main_~#t912~0.offset_11| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t912~0.base_12|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t912~0.base_12| 4) |v_#length_11|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t912~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t912~0.offset=|v_ULTIMATE.start_main_~#t912~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t912~0.base=|v_ULTIMATE.start_main_~#t912~0.base_12|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t912~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t912~0.base, #length] because there is no mapped edge [2019-12-18 21:11:33,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [578] [578] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= 0 (mod v_~x$w_buff1_used~0_34 256)) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= 1 v_~x$w_buff0_used~0_60) (= 1 v_~x$w_buff0~0_16) (= v_~x$w_buff1_used~0_34 v_~x$w_buff0_used~0_61) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff0~0_17 v_~x$w_buff1~0_13) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_61} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~x$w_buff1~0=v_~x$w_buff1~0_13, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_34, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_60} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 21:11:33,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-951740861 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-951740861 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-951740861|)) (and (= ~x$w_buff0_used~0_In-951740861 |P1Thread1of1ForFork0_#t~ite28_Out-951740861|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-951740861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-951740861} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-951740861, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-951740861|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-951740861} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 21:11:33,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1940715803 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1940715803 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1940715803 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1940715803 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out1940715803| ~x$w_buff1_used~0_In1940715803) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out1940715803| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1940715803, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1940715803, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1940715803, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1940715803} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1940715803, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1940715803, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1940715803, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1940715803|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1940715803} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 21:11:33,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1809684140 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1809684140 256) 0))) (or (and (= 0 ~x$r_buff0_thd2~0_Out1809684140) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In1809684140 ~x$r_buff0_thd2~0_Out1809684140)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1809684140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1809684140} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1809684140|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1809684140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1809684140} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 21:11:33,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In190242075 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In190242075 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In190242075 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In190242075 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out190242075| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite31_Out190242075| ~x$r_buff1_thd2~0_In190242075) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In190242075, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In190242075, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In190242075, ~x$w_buff0_used~0=~x$w_buff0_used~0_In190242075} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out190242075|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In190242075, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In190242075, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In190242075, ~x$w_buff0_used~0=~x$w_buff0_used~0_In190242075} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 21:11:33,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L781-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 21:11:33,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_39 v_~x$r_buff0_thd1~0_38) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_38, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-18 21:11:33,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L744-->L752: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_15) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 21:11:33,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [600] [600] L802-1-->L808: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:11:33,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L808-2-->L808-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In138556538 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In138556538 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite34_Out138556538| ~x~0_In138556538)) (and (not .cse1) (= ~x$w_buff1~0_In138556538 |ULTIMATE.start_main_#t~ite34_Out138556538|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In138556538, ~x$w_buff1_used~0=~x$w_buff1_used~0_In138556538, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In138556538, ~x~0=~x~0_In138556538} OutVars{~x$w_buff1~0=~x$w_buff1~0_In138556538, ~x$w_buff1_used~0=~x$w_buff1_used~0_In138556538, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In138556538, ~x~0=~x~0_In138556538, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out138556538|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 21:11:33,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L808-4-->L809: Formula: (= v_~x~0_13 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~x~0=v_~x~0_13, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 21:11:33,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1050293049 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1050293049 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1050293049| ~x$w_buff0_used~0_In-1050293049)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1050293049| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1050293049, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1050293049} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1050293049, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1050293049|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1050293049} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 21:11:33,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-780453771 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-780453771 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-780453771 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-780453771 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out-780453771| ~x$w_buff1_used~0_In-780453771) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite37_Out-780453771| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-780453771, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-780453771, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-780453771, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-780453771} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-780453771, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-780453771, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-780453771|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-780453771, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-780453771} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 21:11:33,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1689872537 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1689872537 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out1689872537|)) (and (= ~x$r_buff0_thd0~0_In1689872537 |ULTIMATE.start_main_#t~ite38_Out1689872537|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1689872537, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1689872537} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1689872537, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1689872537|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1689872537} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 21:11:33,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-161254250 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-161254250 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-161254250 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-161254250 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-161254250|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In-161254250 |ULTIMATE.start_main_#t~ite39_Out-161254250|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-161254250, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-161254250, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-161254250, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-161254250} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-161254250, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-161254250|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-161254250, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-161254250, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-161254250} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:11:33,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_11 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 1 v_~__unbuffered_p1_EAX~0_8) (= 0 v_~__unbuffered_p0_EAX~0_10) (= v_~main$tmp_guard1~0_11 0) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite39_9|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_9|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:11:33,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:11:33 BasicIcfg [2019-12-18 21:11:33,436 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:11:33,438 INFO L168 Benchmark]: Toolchain (without parser) took 10427.23 ms. Allocated memory was 140.0 MB in the beginning and 368.6 MB in the end (delta: 228.6 MB). Free memory was 102.4 MB in the beginning and 271.6 MB in the end (delta: -169.2 MB). Peak memory consumption was 269.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:33,438 INFO L168 Benchmark]: CDTParser took 1.32 ms. Allocated memory is still 140.0 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 21:11:33,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.55 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 102.2 MB in the beginning and 157.0 MB in the end (delta: -54.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:33,440 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.34 ms. Allocated memory is still 204.5 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:33,440 INFO L168 Benchmark]: Boogie Preprocessor took 36.46 ms. Allocated memory is still 204.5 MB. Free memory was 154.4 MB in the beginning and 152.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:33,441 INFO L168 Benchmark]: RCFGBuilder took 761.81 ms. Allocated memory is still 204.5 MB. Free memory was 152.4 MB in the beginning and 111.0 MB in the end (delta: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:33,442 INFO L168 Benchmark]: TraceAbstraction took 8777.88 ms. Allocated memory was 204.5 MB in the beginning and 368.6 MB in the end (delta: 164.1 MB). Free memory was 111.0 MB in the beginning and 271.6 MB in the end (delta: -160.6 MB). Peak memory consumption was 213.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:33,446 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.32 ms. Allocated memory is still 140.0 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 782.55 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 102.2 MB in the beginning and 157.0 MB in the end (delta: -54.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.34 ms. Allocated memory is still 204.5 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.46 ms. Allocated memory is still 204.5 MB. Free memory was 154.4 MB in the beginning and 152.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 761.81 ms. Allocated memory is still 204.5 MB. Free memory was 152.4 MB in the beginning and 111.0 MB in the end (delta: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8777.88 ms. Allocated memory was 204.5 MB in the beginning and 368.6 MB in the end (delta: 164.1 MB). Free memory was 111.0 MB in the beginning and 271.6 MB in the end (delta: -160.6 MB). Peak memory consumption was 213.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 137 ProgramPointsBefore, 68 ProgramPointsAfterwards, 165 TransitionsBefore, 81 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 18 ChoiceCompositions, 4328 VarBasedMoverChecksPositive, 156 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 47140 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t911, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t912, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L729] 1 z = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L742] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1528 SDtfs, 1268 SDslu, 2924 SDs, 0 SdLazy, 1334 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7039occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 3074 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 383 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 31007 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...