/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/mix031_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:13:20,707 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:13:20,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:13:20,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:13:20,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:13:20,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:13:20,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:13:20,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:13:20,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:13:20,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:13:20,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:13:20,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:13:20,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:13:20,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:13:20,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:13:20,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:13:20,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:13:20,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:13:20,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:13:20,771 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:13:20,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:13:20,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:13:20,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:13:20,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:13:20,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:13:20,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:13:20,784 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:13:20,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:13:20,787 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:13:20,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:13:20,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:13:20,791 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:13:20,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:13:20,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:13:20,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:13:20,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:13:20,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:13:20,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:13:20,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:13:20,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:13:20,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:13:20,798 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-27 06:13:20,831 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:13:20,832 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:13:20,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:13:20,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:13:20,837 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:13:20,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:13:20,838 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:13:20,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:13:20,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:13:20,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:13:20,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:13:20,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:13:20,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:13:20,839 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:13:20,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:13:20,840 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:13:20,840 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:13:20,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:13:20,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:13:20,840 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:13:20,841 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:13:20,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:13:20,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:13:20,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:13:20,842 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:13:20,842 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:13:20,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:13:20,843 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:13:20,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:13:20,843 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:13:21,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:13:21,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:13:21,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:13:21,141 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:13:21,141 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:13:21,143 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_tso.oepc.i [2019-12-27 06:13:21,209 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d37ad26db/2d14afe43570466fba123187bedf9ade/FLAG2e3843f0c [2019-12-27 06:13:21,793 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:13:21,794 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_tso.oepc.i [2019-12-27 06:13:21,823 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d37ad26db/2d14afe43570466fba123187bedf9ade/FLAG2e3843f0c [2019-12-27 06:13:22,049 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d37ad26db/2d14afe43570466fba123187bedf9ade [2019-12-27 06:13:22,061 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:13:22,063 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:13:22,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:13:22,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:13:22,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:13:22,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:13:22" (1/1) ... [2019-12-27 06:13:22,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73b89a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:22, skipping insertion in model container [2019-12-27 06:13:22,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:13:22" (1/1) ... [2019-12-27 06:13:22,080 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:13:22,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:13:22,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:13:22,682 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:13:22,761 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:13:22,842 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:13:22,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:22 WrapperNode [2019-12-27 06:13:22,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:13:22,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:13:22,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:13:22,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:13:22,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:22" (1/1) ... [2019-12-27 06:13:22,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:22" (1/1) ... [2019-12-27 06:13:22,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:13:22,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:13:22,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:13:22,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:13:22,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:22" (1/1) ... [2019-12-27 06:13:22,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:22" (1/1) ... [2019-12-27 06:13:22,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:22" (1/1) ... [2019-12-27 06:13:22,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:22" (1/1) ... [2019-12-27 06:13:22,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:22" (1/1) ... [2019-12-27 06:13:22,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:22" (1/1) ... [2019-12-27 06:13:22,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:22" (1/1) ... [2019-12-27 06:13:22,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:13:22,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:13:22,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:13:22,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:13:22,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:13:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:13:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:13:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:13:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:13:23,020 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:13:23,020 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:13:23,020 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:13:23,020 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:13:23,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:13:23,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:13:23,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:13:23,022 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:13:23,698 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:13:23,698 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:13:23,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:13:23 BoogieIcfgContainer [2019-12-27 06:13:23,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:13:23,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:13:23,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:13:23,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:13:23,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:13:22" (1/3) ... [2019-12-27 06:13:23,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc22205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:13:23, skipping insertion in model container [2019-12-27 06:13:23,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:22" (2/3) ... [2019-12-27 06:13:23,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc22205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:13:23, skipping insertion in model container [2019-12-27 06:13:23,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:13:23" (3/3) ... [2019-12-27 06:13:23,715 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_tso.oepc.i [2019-12-27 06:13:23,727 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:13:23,727 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:13:23,738 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:13:23,739 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:13:23,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,797 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,798 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,798 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,800 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,800 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,816 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,817 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,885 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,885 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,886 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,892 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,894 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:23,910 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 06:13:23,931 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:13:23,932 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:13:23,932 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:13:23,932 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:13:23,932 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:13:23,932 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:13:23,932 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:13:23,932 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:13:23,948 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 185 transitions [2019-12-27 06:13:23,949 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-27 06:13:24,040 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-27 06:13:24,041 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:13:24,054 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:13:24,072 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-27 06:13:24,120 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-27 06:13:24,120 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:13:24,126 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:13:24,140 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 06:13:24,141 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:13:27,476 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 06:13:27,590 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 06:13:27,784 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 06:13:27,927 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 06:13:27,948 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56825 [2019-12-27 06:13:27,948 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 06:13:27,951 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-27 06:13:28,400 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8850 states. [2019-12-27 06:13:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 8850 states. [2019-12-27 06:13:28,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:13:28,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:28,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:13:28,410 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:28,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:28,417 INFO L82 PathProgramCache]: Analyzing trace with hash 799211, now seen corresponding path program 1 times [2019-12-27 06:13:28,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:28,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814759951] [2019-12-27 06:13:28,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:28,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814759951] [2019-12-27 06:13:28,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:28,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:13:28,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660940648] [2019-12-27 06:13:28,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:13:28,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:28,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:13:28,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:28,670 INFO L87 Difference]: Start difference. First operand 8850 states. Second operand 3 states. [2019-12-27 06:13:28,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:28,951 INFO L93 Difference]: Finished difference Result 8682 states and 28632 transitions. [2019-12-27 06:13:28,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:13:28,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:13:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:29,032 INFO L225 Difference]: With dead ends: 8682 [2019-12-27 06:13:29,033 INFO L226 Difference]: Without dead ends: 8178 [2019-12-27 06:13:29,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:29,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8178 states. [2019-12-27 06:13:29,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8178 to 8178. [2019-12-27 06:13:29,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8178 states. [2019-12-27 06:13:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8178 states to 8178 states and 26922 transitions. [2019-12-27 06:13:29,530 INFO L78 Accepts]: Start accepts. Automaton has 8178 states and 26922 transitions. Word has length 3 [2019-12-27 06:13:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:29,531 INFO L462 AbstractCegarLoop]: Abstraction has 8178 states and 26922 transitions. [2019-12-27 06:13:29,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:13:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 8178 states and 26922 transitions. [2019-12-27 06:13:29,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:13:29,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:29,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:29,537 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:29,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:29,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1718486747, now seen corresponding path program 1 times [2019-12-27 06:13:29,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:29,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234997154] [2019-12-27 06:13:29,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:29,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234997154] [2019-12-27 06:13:29,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:29,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:13:29,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794245081] [2019-12-27 06:13:29,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:13:29,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:29,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:13:29,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:29,654 INFO L87 Difference]: Start difference. First operand 8178 states and 26922 transitions. Second operand 3 states. [2019-12-27 06:13:29,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:29,689 INFO L93 Difference]: Finished difference Result 1311 states and 3027 transitions. [2019-12-27 06:13:29,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:13:29,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 06:13:29,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:29,697 INFO L225 Difference]: With dead ends: 1311 [2019-12-27 06:13:29,698 INFO L226 Difference]: Without dead ends: 1311 [2019-12-27 06:13:29,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:29,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-12-27 06:13:29,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2019-12-27 06:13:29,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-12-27 06:13:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 3027 transitions. [2019-12-27 06:13:29,736 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 3027 transitions. Word has length 11 [2019-12-27 06:13:29,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:29,737 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 3027 transitions. [2019-12-27 06:13:29,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:13:29,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 3027 transitions. [2019-12-27 06:13:29,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:13:29,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:29,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:29,744 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:29,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:29,744 INFO L82 PathProgramCache]: Analyzing trace with hash 950402147, now seen corresponding path program 1 times [2019-12-27 06:13:29,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:29,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623634831] [2019-12-27 06:13:29,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:29,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:29,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623634831] [2019-12-27 06:13:29,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:29,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:13:29,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004458181] [2019-12-27 06:13:29,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:13:29,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:29,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:13:29,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:29,865 INFO L87 Difference]: Start difference. First operand 1311 states and 3027 transitions. Second operand 3 states. [2019-12-27 06:13:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:29,931 INFO L93 Difference]: Finished difference Result 2020 states and 4648 transitions. [2019-12-27 06:13:29,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:13:29,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 06:13:29,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:29,945 INFO L225 Difference]: With dead ends: 2020 [2019-12-27 06:13:29,945 INFO L226 Difference]: Without dead ends: 2020 [2019-12-27 06:13:29,946 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-27 06:13:29,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2019-12-27 06:13:29,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1471. [2019-12-27 06:13:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-12-27 06:13:29,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 3484 transitions. [2019-12-27 06:13:29,991 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 3484 transitions. Word has length 14 [2019-12-27 06:13:29,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:29,992 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 3484 transitions. [2019-12-27 06:13:29,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:13:29,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 3484 transitions. [2019-12-27 06:13:29,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:13:29,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:29,993 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:29,993 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:29,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:29,994 INFO L82 PathProgramCache]: Analyzing trace with hash 950504478, now seen corresponding path program 1 times [2019-12-27 06:13:29,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:29,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784564100] [2019-12-27 06:13:29,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:30,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784564100] [2019-12-27 06:13:30,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:30,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:13:30,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076493847] [2019-12-27 06:13:30,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:13:30,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:30,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:13:30,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:30,077 INFO L87 Difference]: Start difference. First operand 1471 states and 3484 transitions. Second operand 4 states. [2019-12-27 06:13:30,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:30,348 INFO L93 Difference]: Finished difference Result 1830 states and 4214 transitions. [2019-12-27 06:13:30,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:13:30,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 06:13:30,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:30,359 INFO L225 Difference]: With dead ends: 1830 [2019-12-27 06:13:30,360 INFO L226 Difference]: Without dead ends: 1830 [2019-12-27 06:13:30,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:13:30,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2019-12-27 06:13:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1766. [2019-12-27 06:13:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2019-12-27 06:13:30,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 4090 transitions. [2019-12-27 06:13:30,406 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 4090 transitions. Word has length 14 [2019-12-27 06:13:30,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:30,406 INFO L462 AbstractCegarLoop]: Abstraction has 1766 states and 4090 transitions. [2019-12-27 06:13:30,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:13:30,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 4090 transitions. [2019-12-27 06:13:30,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:13:30,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:30,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:30,408 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:30,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:30,408 INFO L82 PathProgramCache]: Analyzing trace with hash 785604646, now seen corresponding path program 1 times [2019-12-27 06:13:30,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:30,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232795119] [2019-12-27 06:13:30,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:30,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:30,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232795119] [2019-12-27 06:13:30,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:30,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:13:30,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742728705] [2019-12-27 06:13:30,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:13:30,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:30,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:13:30,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:30,456 INFO L87 Difference]: Start difference. First operand 1766 states and 4090 transitions. Second operand 4 states. [2019-12-27 06:13:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:30,639 INFO L93 Difference]: Finished difference Result 2141 states and 4886 transitions. [2019-12-27 06:13:30,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:13:30,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 06:13:30,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:30,651 INFO L225 Difference]: With dead ends: 2141 [2019-12-27 06:13:30,652 INFO L226 Difference]: Without dead ends: 2141 [2019-12-27 06:13:30,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:13:30,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2019-12-27 06:13:30,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 1881. [2019-12-27 06:13:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2019-12-27 06:13:30,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 4350 transitions. [2019-12-27 06:13:30,699 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 4350 transitions. Word has length 14 [2019-12-27 06:13:30,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:30,700 INFO L462 AbstractCegarLoop]: Abstraction has 1881 states and 4350 transitions. [2019-12-27 06:13:30,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:13:30,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 4350 transitions. [2019-12-27 06:13:30,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:13:30,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:30,703 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] [2019-12-27 06:13:30,703 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:30,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:30,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1292642456, now seen corresponding path program 1 times [2019-12-27 06:13:30,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:30,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547107975] [2019-12-27 06:13:30,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:30,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547107975] [2019-12-27 06:13:30,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:30,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:13:30,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802135550] [2019-12-27 06:13:30,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:13:30,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:30,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:13:30,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:13:30,775 INFO L87 Difference]: Start difference. First operand 1881 states and 4350 transitions. Second operand 5 states. [2019-12-27 06:13:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:31,051 INFO L93 Difference]: Finished difference Result 2408 states and 5400 transitions. [2019-12-27 06:13:31,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:13:31,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 06:13:31,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:31,073 INFO L225 Difference]: With dead ends: 2408 [2019-12-27 06:13:31,073 INFO L226 Difference]: Without dead ends: 2408 [2019-12-27 06:13:31,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:13:31,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2019-12-27 06:13:31,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2152. [2019-12-27 06:13:31,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2019-12-27 06:13:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 4906 transitions. [2019-12-27 06:13:31,133 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 4906 transitions. Word has length 25 [2019-12-27 06:13:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:31,134 INFO L462 AbstractCegarLoop]: Abstraction has 2152 states and 4906 transitions. [2019-12-27 06:13:31,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:13:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 4906 transitions. [2019-12-27 06:13:31,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 06:13:31,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:31,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:31,137 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:31,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:31,137 INFO L82 PathProgramCache]: Analyzing trace with hash -797480945, now seen corresponding path program 1 times [2019-12-27 06:13:31,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:31,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636615874] [2019-12-27 06:13:31,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:31,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636615874] [2019-12-27 06:13:31,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:31,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:13:31,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692658929] [2019-12-27 06:13:31,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:13:31,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:31,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:13:31,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:31,225 INFO L87 Difference]: Start difference. First operand 2152 states and 4906 transitions. Second operand 4 states. [2019-12-27 06:13:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:31,243 INFO L93 Difference]: Finished difference Result 1117 states and 2441 transitions. [2019-12-27 06:13:31,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:13:31,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 06:13:31,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:31,247 INFO L225 Difference]: With dead ends: 1117 [2019-12-27 06:13:31,248 INFO L226 Difference]: Without dead ends: 1117 [2019-12-27 06:13:31,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:31,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2019-12-27 06:13:31,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1059. [2019-12-27 06:13:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2019-12-27 06:13:31,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 2334 transitions. [2019-12-27 06:13:31,271 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 2334 transitions. Word has length 26 [2019-12-27 06:13:31,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:31,272 INFO L462 AbstractCegarLoop]: Abstraction has 1059 states and 2334 transitions. [2019-12-27 06:13:31,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:13:31,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 2334 transitions. [2019-12-27 06:13:31,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 06:13:31,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:31,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:31,275 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:31,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:31,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1810395798, now seen corresponding path program 1 times [2019-12-27 06:13:31,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:31,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314638763] [2019-12-27 06:13:31,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:31,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314638763] [2019-12-27 06:13:31,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:31,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:13:31,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975358596] [2019-12-27 06:13:31,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:13:31,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:31,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:13:31,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:13:31,411 INFO L87 Difference]: Start difference. First operand 1059 states and 2334 transitions. Second operand 5 states. [2019-12-27 06:13:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:31,645 INFO L93 Difference]: Finished difference Result 1193 states and 2576 transitions. [2019-12-27 06:13:31,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:13:31,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 06:13:31,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:31,648 INFO L225 Difference]: With dead ends: 1193 [2019-12-27 06:13:31,648 INFO L226 Difference]: Without dead ends: 1193 [2019-12-27 06:13:31,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:13:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-12-27 06:13:31,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 955. [2019-12-27 06:13:31,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2019-12-27 06:13:31,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 2121 transitions. [2019-12-27 06:13:31,669 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 2121 transitions. Word has length 26 [2019-12-27 06:13:31,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:31,670 INFO L462 AbstractCegarLoop]: Abstraction has 955 states and 2121 transitions. [2019-12-27 06:13:31,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:13:31,670 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 2121 transitions. [2019-12-27 06:13:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:13:31,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:31,673 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:31,674 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:31,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:31,674 INFO L82 PathProgramCache]: Analyzing trace with hash 15300526, now seen corresponding path program 1 times [2019-12-27 06:13:31,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:31,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096507868] [2019-12-27 06:13:31,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:31,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:31,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096507868] [2019-12-27 06:13:31,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:31,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:13:31,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353734006] [2019-12-27 06:13:31,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:13:31,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:31,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:13:31,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:13:31,764 INFO L87 Difference]: Start difference. First operand 955 states and 2121 transitions. Second operand 7 states. [2019-12-27 06:13:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:32,065 INFO L93 Difference]: Finished difference Result 2800 states and 6130 transitions. [2019-12-27 06:13:32,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 06:13:32,065 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 06:13:32,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:32,072 INFO L225 Difference]: With dead ends: 2800 [2019-12-27 06:13:32,072 INFO L226 Difference]: Without dead ends: 1901 [2019-12-27 06:13:32,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:13:32,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2019-12-27 06:13:32,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1056. [2019-12-27 06:13:32,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2019-12-27 06:13:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 2353 transitions. [2019-12-27 06:13:32,101 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 2353 transitions. Word has length 51 [2019-12-27 06:13:32,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:32,102 INFO L462 AbstractCegarLoop]: Abstraction has 1056 states and 2353 transitions. [2019-12-27 06:13:32,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:13:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 2353 transitions. [2019-12-27 06:13:32,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:13:32,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:32,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:32,106 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:32,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:32,106 INFO L82 PathProgramCache]: Analyzing trace with hash -671171562, now seen corresponding path program 2 times [2019-12-27 06:13:32,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:32,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361036317] [2019-12-27 06:13:32,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:32,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:32,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361036317] [2019-12-27 06:13:32,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:32,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:13:32,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470189087] [2019-12-27 06:13:32,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:13:32,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:32,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:13:32,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:32,175 INFO L87 Difference]: Start difference. First operand 1056 states and 2353 transitions. Second operand 4 states. [2019-12-27 06:13:32,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:32,194 INFO L93 Difference]: Finished difference Result 1633 states and 3700 transitions. [2019-12-27 06:13:32,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:13:32,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-27 06:13:32,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:32,196 INFO L225 Difference]: With dead ends: 1633 [2019-12-27 06:13:32,197 INFO L226 Difference]: Without dead ends: 622 [2019-12-27 06:13:32,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:13:32,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-12-27 06:13:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2019-12-27 06:13:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-12-27 06:13:32,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1432 transitions. [2019-12-27 06:13:32,210 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1432 transitions. Word has length 51 [2019-12-27 06:13:32,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:32,210 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 1432 transitions. [2019-12-27 06:13:32,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:13:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1432 transitions. [2019-12-27 06:13:32,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:13:32,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:32,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:32,213 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:32,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:32,213 INFO L82 PathProgramCache]: Analyzing trace with hash 898082634, now seen corresponding path program 3 times [2019-12-27 06:13:32,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:32,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705387343] [2019-12-27 06:13:32,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:32,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705387343] [2019-12-27 06:13:32,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:32,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:13:32,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319721936] [2019-12-27 06:13:32,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:13:32,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:32,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:13:32,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:13:32,326 INFO L87 Difference]: Start difference. First operand 622 states and 1432 transitions. Second operand 5 states. [2019-12-27 06:13:32,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:32,553 INFO L93 Difference]: Finished difference Result 743 states and 1651 transitions. [2019-12-27 06:13:32,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:13:32,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-27 06:13:32,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:32,555 INFO L225 Difference]: With dead ends: 743 [2019-12-27 06:13:32,556 INFO L226 Difference]: Without dead ends: 743 [2019-12-27 06:13:32,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:13:32,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-12-27 06:13:32,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 705. [2019-12-27 06:13:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-12-27 06:13:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1584 transitions. [2019-12-27 06:13:32,570 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1584 transitions. Word has length 51 [2019-12-27 06:13:32,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:32,571 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 1584 transitions. [2019-12-27 06:13:32,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:13:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1584 transitions. [2019-12-27 06:13:32,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:13:32,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:32,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:32,573 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:32,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:32,573 INFO L82 PathProgramCache]: Analyzing trace with hash 440616472, now seen corresponding path program 4 times [2019-12-27 06:13:32,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:32,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811602517] [2019-12-27 06:13:32,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:32,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:32,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811602517] [2019-12-27 06:13:32,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:32,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:13:32,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9994914] [2019-12-27 06:13:32,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:13:32,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:32,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:13:32,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:32,699 INFO L87 Difference]: Start difference. First operand 705 states and 1584 transitions. Second operand 3 states. [2019-12-27 06:13:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:32,712 INFO L93 Difference]: Finished difference Result 704 states and 1582 transitions. [2019-12-27 06:13:32,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:13:32,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 06:13:32,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:32,715 INFO L225 Difference]: With dead ends: 704 [2019-12-27 06:13:32,715 INFO L226 Difference]: Without dead ends: 704 [2019-12-27 06:13:32,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:32,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-12-27 06:13:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 631. [2019-12-27 06:13:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-12-27 06:13:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1452 transitions. [2019-12-27 06:13:32,730 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1452 transitions. Word has length 51 [2019-12-27 06:13:32,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:32,730 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 1452 transitions. [2019-12-27 06:13:32,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:13:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1452 transitions. [2019-12-27 06:13:32,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:13:32,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:32,733 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:32,733 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:32,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:32,734 INFO L82 PathProgramCache]: Analyzing trace with hash 578834260, now seen corresponding path program 1 times [2019-12-27 06:13:32,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:32,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008351347] [2019-12-27 06:13:32,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:32,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:32,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008351347] [2019-12-27 06:13:32,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:32,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:13:32,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015360288] [2019-12-27 06:13:32,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:13:32,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:32,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:13:32,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:32,909 INFO L87 Difference]: Start difference. First operand 631 states and 1452 transitions. Second operand 3 states. [2019-12-27 06:13:32,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:32,978 INFO L93 Difference]: Finished difference Result 776 states and 1751 transitions. [2019-12-27 06:13:32,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:13:32,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 06:13:32,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:32,980 INFO L225 Difference]: With dead ends: 776 [2019-12-27 06:13:32,980 INFO L226 Difference]: Without dead ends: 776 [2019-12-27 06:13:32,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:32,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2019-12-27 06:13:32,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 688. [2019-12-27 06:13:32,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-12-27 06:13:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1575 transitions. [2019-12-27 06:13:32,999 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1575 transitions. Word has length 52 [2019-12-27 06:13:32,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:32,999 INFO L462 AbstractCegarLoop]: Abstraction has 688 states and 1575 transitions. [2019-12-27 06:13:32,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:13:32,999 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1575 transitions. [2019-12-27 06:13:33,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:13:33,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:33,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:33,003 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:33,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:33,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1517325742, now seen corresponding path program 1 times [2019-12-27 06:13:33,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:33,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440968684] [2019-12-27 06:13:33,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:33,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:33,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440968684] [2019-12-27 06:13:33,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:33,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:13:33,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802633872] [2019-12-27 06:13:33,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:13:33,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:33,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:13:33,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:13:33,122 INFO L87 Difference]: Start difference. First operand 688 states and 1575 transitions. Second operand 7 states. [2019-12-27 06:13:33,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:33,355 INFO L93 Difference]: Finished difference Result 1682 states and 3601 transitions. [2019-12-27 06:13:33,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:13:33,355 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 06:13:33,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:33,359 INFO L225 Difference]: With dead ends: 1682 [2019-12-27 06:13:33,359 INFO L226 Difference]: Without dead ends: 1431 [2019-12-27 06:13:33,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:13:33,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-12-27 06:13:33,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 689. [2019-12-27 06:13:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-12-27 06:13:33,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1579 transitions. [2019-12-27 06:13:33,380 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1579 transitions. Word has length 53 [2019-12-27 06:13:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:33,381 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1579 transitions. [2019-12-27 06:13:33,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:13:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1579 transitions. [2019-12-27 06:13:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:13:33,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:33,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:33,383 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:33,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:33,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1731920874, now seen corresponding path program 2 times [2019-12-27 06:13:33,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:33,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106006129] [2019-12-27 06:13:33,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:33,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:33,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106006129] [2019-12-27 06:13:33,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:33,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:13:33,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836768038] [2019-12-27 06:13:33,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:13:33,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:33,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:13:33,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:33,458 INFO L87 Difference]: Start difference. First operand 689 states and 1579 transitions. Second operand 4 states. [2019-12-27 06:13:33,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:33,670 INFO L93 Difference]: Finished difference Result 1232 states and 2758 transitions. [2019-12-27 06:13:33,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:13:33,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 06:13:33,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:33,674 INFO L225 Difference]: With dead ends: 1232 [2019-12-27 06:13:33,674 INFO L226 Difference]: Without dead ends: 1232 [2019-12-27 06:13:33,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:13:33,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-27 06:13:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 758. [2019-12-27 06:13:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-12-27 06:13:33,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1743 transitions. [2019-12-27 06:13:33,693 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1743 transitions. Word has length 53 [2019-12-27 06:13:33,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:33,694 INFO L462 AbstractCegarLoop]: Abstraction has 758 states and 1743 transitions. [2019-12-27 06:13:33,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:13:33,694 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1743 transitions. [2019-12-27 06:13:33,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:13:33,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:33,696 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:33,696 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:33,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:33,697 INFO L82 PathProgramCache]: Analyzing trace with hash 912007604, now seen corresponding path program 3 times [2019-12-27 06:13:33,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:33,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417481813] [2019-12-27 06:13:33,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:33,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:33,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417481813] [2019-12-27 06:13:33,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:33,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:13:33,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083382299] [2019-12-27 06:13:33,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:13:33,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:33,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:13:33,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:33,754 INFO L87 Difference]: Start difference. First operand 758 states and 1743 transitions. Second operand 4 states. [2019-12-27 06:13:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:33,857 INFO L93 Difference]: Finished difference Result 1034 states and 2318 transitions. [2019-12-27 06:13:33,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:13:33,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 06:13:33,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:33,860 INFO L225 Difference]: With dead ends: 1034 [2019-12-27 06:13:33,860 INFO L226 Difference]: Without dead ends: 1034 [2019-12-27 06:13:33,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:33,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2019-12-27 06:13:33,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 744. [2019-12-27 06:13:33,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-12-27 06:13:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1718 transitions. [2019-12-27 06:13:33,876 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1718 transitions. Word has length 53 [2019-12-27 06:13:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:33,877 INFO L462 AbstractCegarLoop]: Abstraction has 744 states and 1718 transitions. [2019-12-27 06:13:33,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:13:33,877 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1718 transitions. [2019-12-27 06:13:33,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:13:33,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:33,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:33,879 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:33,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:33,880 INFO L82 PathProgramCache]: Analyzing trace with hash 444800354, now seen corresponding path program 4 times [2019-12-27 06:13:33,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:33,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588465973] [2019-12-27 06:13:33,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:33,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:33,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588465973] [2019-12-27 06:13:33,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:33,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:13:33,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889060024] [2019-12-27 06:13:33,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:13:33,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:33,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:13:33,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:13:33,962 INFO L87 Difference]: Start difference. First operand 744 states and 1718 transitions. Second operand 5 states. [2019-12-27 06:13:34,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:34,251 INFO L93 Difference]: Finished difference Result 1203 states and 2713 transitions. [2019-12-27 06:13:34,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:13:34,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 06:13:34,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:34,256 INFO L225 Difference]: With dead ends: 1203 [2019-12-27 06:13:34,256 INFO L226 Difference]: Without dead ends: 1203 [2019-12-27 06:13:34,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:13:34,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-12-27 06:13:34,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 726. [2019-12-27 06:13:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-12-27 06:13:34,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1668 transitions. [2019-12-27 06:13:34,277 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1668 transitions. Word has length 53 [2019-12-27 06:13:34,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:34,278 INFO L462 AbstractCegarLoop]: Abstraction has 726 states and 1668 transitions. [2019-12-27 06:13:34,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:13:34,278 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1668 transitions. [2019-12-27 06:13:34,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:13:34,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:34,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:34,281 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:34,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:34,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1913174598, now seen corresponding path program 1 times [2019-12-27 06:13:34,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:34,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936464493] [2019-12-27 06:13:34,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:34,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936464493] [2019-12-27 06:13:34,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:34,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:13:34,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184347975] [2019-12-27 06:13:34,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:13:34,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:34,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:13:34,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:34,318 INFO L87 Difference]: Start difference. First operand 726 states and 1668 transitions. Second operand 3 states. [2019-12-27 06:13:34,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:34,362 INFO L93 Difference]: Finished difference Result 847 states and 1774 transitions. [2019-12-27 06:13:34,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:13:34,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 06:13:34,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:34,364 INFO L225 Difference]: With dead ends: 847 [2019-12-27 06:13:34,364 INFO L226 Difference]: Without dead ends: 847 [2019-12-27 06:13:34,365 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-27 06:13:34,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-12-27 06:13:34,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 678. [2019-12-27 06:13:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-12-27 06:13:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1451 transitions. [2019-12-27 06:13:34,379 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1451 transitions. Word has length 53 [2019-12-27 06:13:34,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:34,379 INFO L462 AbstractCegarLoop]: Abstraction has 678 states and 1451 transitions. [2019-12-27 06:13:34,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:13:34,380 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1451 transitions. [2019-12-27 06:13:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:13:34,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:34,381 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:34,382 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:34,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:34,382 INFO L82 PathProgramCache]: Analyzing trace with hash 161095200, now seen corresponding path program 1 times [2019-12-27 06:13:34,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:34,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224014268] [2019-12-27 06:13:34,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:13:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:13:34,510 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:13:34,510 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:13:34,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t845~0.base_25| 1)) (= 0 v_~weak$$choice0~0_9) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~a$read_delayed_var~0.base_8) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t845~0.base_25| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t845~0.base_25|) |v_ULTIMATE.start_main_~#t845~0.offset_19| 0)) |v_#memory_int_17|) (= 0 v_~a$r_buff1_thd2~0_49) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t845~0.base_25|) (= 0 v_~a$read_delayed~0_7) (= 0 v_~a$w_buff0_used~0_103) (= (select .cse0 |v_ULTIMATE.start_main_~#t845~0.base_25|) 0) (< 0 |v_#StackHeapBarrier_16|) (= v_~__unbuffered_p0_EBX~0_13 0) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_34) (= |v_#NULL.offset_2| 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t845~0.base_25| 4) |v_#length_19|) (= v_~a$flush_delayed~0_13 0) (= 0 v_~a$r_buff1_thd1~0_18) (= 0 v_~a$w_buff0~0_29) (= 0 v_~a$w_buff1~0_28) (= v_~a$r_buff0_thd1~0_24 0) (= v_~a~0_24 0) (= v_~a$mem_tmp~0_10 0) (= v_~__unbuffered_p1_EBX~0_16 0) (= 0 v_~z~0_9) (= v_~a$r_buff0_thd2~0_76 0) (= v_~y~0_10 0) (= v_~main$tmp_guard0~0_11 0) (= v_~a$read_delayed_var~0.offset_8 0) (= 0 v_~__unbuffered_cnt~0_18) (= 0 v_~a$w_buff1_used~0_68) (= v_~a$r_buff0_thd0~0_19 0) (= 0 |v_ULTIMATE.start_main_~#t845~0.offset_19|) (= 0 |v_#NULL.base_2|) (= 0 v_~a$r_buff1_thd0~0_20))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_49, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_76, #NULL.offset=|v_#NULL.offset_2|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ~a~0=v_~a~0_24, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~a$w_buff1~0=v_~a$w_buff1~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_19|, ~y~0=v_~y~0_10, ULTIMATE.start_main_~#t845~0.offset=|v_ULTIMATE.start_main_~#t845~0.offset_19|, ULTIMATE.start_main_~#t846~0.base=|v_ULTIMATE.start_main_~#t846~0.base_21|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_13, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ULTIMATE.start_main_~#t845~0.base=|v_ULTIMATE.start_main_~#t845~0.base_25|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_103, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ULTIMATE.start_main_~#t846~0.offset=|v_ULTIMATE.start_main_~#t846~0.offset_16|, #NULL.base=|v_#NULL.base_2|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~a$w_buff0~0=v_~a$w_buff0~0_29, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_9, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_9, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, #NULL.offset, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t845~0.offset, ULTIMATE.start_main_~#t846~0.base, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t845~0.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t846~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 06:13:34,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= 0 (mod ~a$w_buff1_used~0_Out659037967 256)) (= P0Thread1of1ForFork0_~arg.offset_Out659037967 |P0Thread1of1ForFork0_#in~arg.offset_In659037967|) (= |P0Thread1of1ForFork0_#in~arg.base_In659037967| P0Thread1of1ForFork0_~arg.base_Out659037967) (= ~a$w_buff1~0_Out659037967 ~a$w_buff0~0_In659037967) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out659037967| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out659037967) (= ~a$w_buff0_used~0_Out659037967 1) (= ~a$w_buff0_used~0_In659037967 ~a$w_buff1_used~0_Out659037967) (= ~a$w_buff0~0_Out659037967 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out659037967| 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In659037967|, ~a$w_buff0~0=~a$w_buff0~0_In659037967, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In659037967|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In659037967} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In659037967|, ~a$w_buff1~0=~a$w_buff1~0_Out659037967, ~a$w_buff0~0=~a$w_buff0~0_Out659037967, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out659037967, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In659037967|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out659037967, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out659037967, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out659037967, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out659037967|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out659037967} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 06:13:34,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L814-1-->L816: Formula: (and (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t846~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t846~0.base_10|) |v_ULTIMATE.start_main_~#t846~0.offset_9| 1)) |v_#memory_int_7|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t846~0.base_10|)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t846~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t846~0.offset_9| 0) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t846~0.base_10| 1) |v_#valid_19|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t846~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t846~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t846~0.offset=|v_ULTIMATE.start_main_~#t846~0.offset_9|, ULTIMATE.start_main_~#t846~0.base=|v_ULTIMATE.start_main_~#t846~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t846~0.offset, ULTIMATE.start_main_~#t846~0.base] because there is no mapped edge [2019-12-27 06:13:34,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In209441565 256)))) (or (and (= ~a$w_buff1_used~0_In209441565 |P1Thread1of1ForFork1_#t~ite24_Out209441565|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In209441565| |P1Thread1of1ForFork1_#t~ite23_Out209441565|)) (and (= |P1Thread1of1ForFork1_#t~ite24_Out209441565| |P1Thread1of1ForFork1_#t~ite23_Out209441565|) .cse0 (= ~a$w_buff1_used~0_In209441565 |P1Thread1of1ForFork1_#t~ite23_Out209441565|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In209441565 256)))) (or (and (= 0 (mod ~a$r_buff1_thd2~0_In209441565 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In209441565 256)) (and .cse1 (= (mod ~a$w_buff1_used~0_In209441565 256) 0))))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In209441565, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In209441565, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In209441565|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In209441565, ~a$w_buff1_used~0=~a$w_buff1_used~0_In209441565, ~weak$$choice2~0=~weak$$choice2~0_In209441565} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In209441565, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out209441565|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In209441565, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out209441565|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In209441565, ~a$w_buff1_used~0=~a$w_buff1_used~0_In209441565, ~weak$$choice2~0=~weak$$choice2~0_In209441565} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-27 06:13:34,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_26 256))) (= v_~a$r_buff0_thd2~0_68 v_~a$r_buff0_thd2~0_67)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_26} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_26, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 06:13:34,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In1490924697 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1490924697 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1490924697| ~a$w_buff0_used~0_In1490924697) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1490924697|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1490924697, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1490924697} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1490924697|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1490924697, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1490924697} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:13:34,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In1675317508 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd1~0_In1675317508 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In1675317508 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1675317508 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1675317508| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In1675317508 |P0Thread1of1ForFork0_#t~ite6_Out1675317508|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1675317508, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1675317508, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1675317508, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1675317508} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1675317508|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1675317508, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1675317508, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1675317508, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1675317508} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:13:34,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1311312436 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1311312436 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out1311312436 ~a$r_buff0_thd1~0_In1311312436)) (and (= ~a$r_buff0_thd1~0_Out1311312436 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1311312436, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1311312436} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1311312436|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1311312436, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1311312436} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:13:34,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In-1703987633 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-1703987633 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-1703987633 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In-1703987633 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1703987633| ~a$r_buff1_thd1~0_In-1703987633) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1703987633|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1703987633, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1703987633, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1703987633, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1703987633} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1703987633, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1703987633|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1703987633, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1703987633, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1703987633} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:13:34,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L756-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~a$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:13:34,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a~0_18 v_~a$mem_tmp~0_5) (= v_~a$flush_delayed~0_7 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_18, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 06:13:34,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-517912161 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-517912161 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out-517912161| |P1Thread1of1ForFork1_#t~ite32_Out-517912161|))) (or (and (not .cse0) .cse1 (not .cse2) (= ~a$w_buff1~0_In-517912161 |P1Thread1of1ForFork1_#t~ite32_Out-517912161|)) (and (or .cse0 .cse2) .cse1 (= ~a~0_In-517912161 |P1Thread1of1ForFork1_#t~ite32_Out-517912161|)))) InVars {~a~0=~a~0_In-517912161, ~a$w_buff1~0=~a$w_buff1~0_In-517912161, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-517912161, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-517912161} OutVars{~a~0=~a~0_In-517912161, ~a$w_buff1~0=~a$w_buff1~0_In-517912161, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-517912161, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-517912161|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-517912161|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-517912161} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 06:13:34,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-196623751 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-196623751 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-196623751| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-196623751| ~a$w_buff0_used~0_In-196623751) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-196623751, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-196623751} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-196623751|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-196623751, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-196623751} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 06:13:34,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In2040601183 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In2040601183 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In2040601183 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd2~0_In2040601183 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In2040601183 |P1Thread1of1ForFork1_#t~ite35_Out2040601183|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out2040601183| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2040601183, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2040601183, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2040601183, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2040601183} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2040601183, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2040601183, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2040601183, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out2040601183|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2040601183} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 06:13:34,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In1067083178 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1067083178 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out1067083178| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out1067083178| ~a$r_buff0_thd2~0_In1067083178) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1067083178, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1067083178} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1067083178, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1067083178, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1067083178|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 06:13:34,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-829299612 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-829299612 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-829299612 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd2~0_In-829299612 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd2~0_In-829299612 |P1Thread1of1ForFork1_#t~ite37_Out-829299612|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-829299612|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-829299612, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-829299612, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-829299612, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-829299612} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-829299612, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-829299612, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-829299612, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-829299612, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-829299612|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 06:13:34,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~a$r_buff1_thd2~0_42 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_42, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 06:13:34,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_3|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 06:13:34,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In1178735238 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1178735238 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1178735238| ~a~0_In1178735238) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1178735238| ~a$w_buff1~0_In1178735238) (not .cse0)))) InVars {~a~0=~a~0_In1178735238, ~a$w_buff1~0=~a$w_buff1~0_In1178735238, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1178735238, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1178735238} OutVars{~a~0=~a~0_In1178735238, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1178735238|, ~a$w_buff1~0=~a$w_buff1~0_In1178735238, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1178735238, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1178735238} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 06:13:34,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_16 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{~a~0=v_~a~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 06:13:34,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-782390194 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-782390194 256)))) (or (and (= ~a$w_buff0_used~0_In-782390194 |ULTIMATE.start_main_#t~ite42_Out-782390194|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-782390194|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-782390194, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-782390194} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-782390194, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-782390194, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-782390194|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:13:34,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In412903981 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In412903981 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In412903981 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In412903981 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out412903981| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite43_Out412903981| ~a$w_buff1_used~0_In412903981)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In412903981, ~a$w_buff0_used~0=~a$w_buff0_used~0_In412903981, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In412903981, ~a$w_buff1_used~0=~a$w_buff1_used~0_In412903981} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In412903981, ~a$w_buff0_used~0=~a$w_buff0_used~0_In412903981, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In412903981, ~a$w_buff1_used~0=~a$w_buff1_used~0_In412903981, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out412903981|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 06:13:34,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-2117969239 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-2117969239 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-2117969239| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-2117969239| ~a$r_buff0_thd0~0_In-2117969239)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2117969239, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2117969239} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-2117969239, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2117969239, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2117969239|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:13:34,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In2118064530 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In2118064530 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In2118064530 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In2118064530 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out2118064530| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out2118064530| ~a$r_buff1_thd0~0_In2118064530)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2118064530, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2118064530, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2118064530, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2118064530} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2118064530, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2118064530, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2118064530, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2118064530, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2118064530|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 06:13:34,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start_main_#t~ite45_11| v_~a$r_buff1_thd0~0_13) (= v_~__unbuffered_p0_EBX~0_6 0) (= v_~__unbuffered_p0_EAX~0_8 1) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:13:34,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:13:34 BasicIcfg [2019-12-27 06:13:34,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:13:34,632 INFO L168 Benchmark]: Toolchain (without parser) took 12569.58 ms. Allocated memory was 137.9 MB in the beginning and 421.5 MB in the end (delta: 283.6 MB). Free memory was 99.5 MB in the beginning and 275.5 MB in the end (delta: -176.0 MB). Peak memory consumption was 107.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:13:34,633 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 06:13:34,633 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.07 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.3 MB in the beginning and 157.0 MB in the end (delta: -57.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:13:34,634 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.84 ms. Allocated memory is still 202.4 MB. Free memory was 156.3 MB in the beginning and 154.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:13:34,634 INFO L168 Benchmark]: Boogie Preprocessor took 36.36 ms. Allocated memory is still 202.4 MB. Free memory was 154.3 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:13:34,635 INFO L168 Benchmark]: RCFGBuilder took 752.37 ms. Allocated memory is still 202.4 MB. Free memory was 151.7 MB in the beginning and 106.7 MB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:13:34,636 INFO L168 Benchmark]: TraceAbstraction took 10927.06 ms. Allocated memory was 202.4 MB in the beginning and 421.5 MB in the end (delta: 219.2 MB). Free memory was 106.0 MB in the beginning and 275.5 MB in the end (delta: -169.4 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:13:34,639 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 779.07 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.3 MB in the beginning and 157.0 MB in the end (delta: -57.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.84 ms. Allocated memory is still 202.4 MB. Free memory was 156.3 MB in the beginning and 154.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.36 ms. Allocated memory is still 202.4 MB. Free memory was 154.3 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 752.37 ms. Allocated memory is still 202.4 MB. Free memory was 151.7 MB in the beginning and 106.7 MB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10927.06 ms. Allocated memory was 202.4 MB in the beginning and 421.5 MB in the end (delta: 219.2 MB). Free memory was 106.0 MB in the beginning and 275.5 MB in the end (delta: -169.4 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 151 ProgramPointsBefore, 78 ProgramPointsAfterwards, 185 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 25 ChoiceCompositions, 5025 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 56825 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t845, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t846, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L822] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.5s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2042 SDtfs, 1916 SDslu, 3653 SDs, 0 SdLazy, 1637 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 29 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8850occurred 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.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 4621 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 707 NumberOfCodeBlocks, 707 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 636 ConstructedInterpolants, 0 QuantifiedInterpolants, 96782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...